Bubble sort algoritması c programlama

 Bubble sort algoritması c programlama

#include<stdio.h>
#include<stdlib.h>

void bubblesort(int *numara, int size)
{
int  i=0;
int  k=0;
int temp=0;
for(i=0; i < size - 1 ; ++i)
{
for(k=0; k < size - 1 - i; ++k)
{
if(numara[k] > numara[k+1])
{
temp = numara[k+1];
numara[k+1] = numara[k];
numara[k] = temp;
}
}
}
}

void gosterarray(int *num, int size)
{
int i=0;
for(i=0; i<size;++i)
{
printf("%d. eleman : %d\n",i, num[i]);
}
}

int main()
{
int numara[] = {-2,45,0,11,-9,20};
bubblesort(numara,6);
gosterarray(numara,6);
return 0;
}