C Programlamada Bubblesort (Kabarcık Sıralama)

#include<stdio.h>

#include<conio.h>

void bubbleSort(int dizi[],int n)

{                               

     int i,j,gecici;

     for(i=0;i<n-1;i++){

         for(j=n-1;j>i;j--)

            if(dizi[j]<dizi[j-1])

            {

                gecici=dizi[j];

                dizi[j]=dizi[j-1];

                dizi[j-1]=gecici;

            }

     }    

}

int main()                 

{                          

    int a[50],i,t;        

    printf("dizinin eleman sayisini giriniz:");

    scanf("%d",&t);

    printf("dizinin elemanlarini giriniz\n");

    for(i=0;i<t;i++)

    {

        printf("a[%d]=",i);

        scanf("%d",&a[i]);             

    }

    bubbleSort(a,t);

    printf("dizinin siralanmis hali:\n");

    for(i=0;i<t;i++)

    {

        printf("%d\n",a[i]);

    }

    getch();

    return 0;

}