C语言学习之冒泡排序

# include <stdio.h>
# include <stdlib.h>
void sort(int  * a, int length)
{
int i, j, temp;
for (i=0; i<length-1; i++)
{
for (j=length-1; j>i; j--)
{
if (a[j] < a[j-1])
{
temp =a[j];
a[j] = a[j-1];
a[j-1] = temp;
}
}
}
}
int main(void)
{
int i;
int a[8] = {1, 32, -4, 21, 5, 66, 9, 12};
for (i=0; i<8; i++) //排序前输出
{
printf("a[%d] =%2d\n", i, a[i]);
}
sort(a, 8);         //调用排序函数
printf("------------------------\n排序后:\n");   //排序后输出
for (i=0; i<8; i++)
{
printf("a[%d] =%2d\n", i, a[i]);
}
system("pause");
return 0;
}