1.简单冒泡排序算法
# include <stdio.h>
void main()
{
int i, j, arr[] = {23, 90, 9, 25, 16};
for(i=0; i<4; ++i)
{
for(j=0; j<5; ++j)
printf("%5d", arr[j]);
printf("\n");
for(j=4; j>i; j--)
{
if(arr[j] < arr[j-1])
{
int temp = arr[j];
arr[j] = arr[j-1];
arr[j-1] = temp;
}
}
}
}