十大排序

1 冒泡排序

void bubbleSort(int a[], int n);
int i,j;
int num[10]={2,9,8,4,66,33,55,88,44,959};
int main(void)
{
bubbleSort(num,10);

for(i=0;i<10;i++)
{
printf("%d,",num[i]);
}

return 0;
}

void bubbleSort(int a[], int n)
{
for( i =0 ; i< n-1; ++i)
{
for( j = 0; j < n-i-1; ++j)
{
if(a[j] > a[j+1])
{
int tmp = a[j] ; //交换
a[j] = a[j+1] ;
a[j+1] = tmp;
}
}
}

}