冒泡排序

#include<stdio.h>
#define N 10
int main()
{
int ar[N] = {1,5,7,9,4,9,4,6,4,8};
for (int i=0; i < N-1; ++i)//进行九次比较
{
for (int j = 0; j < N-i-1; ++j)//每次进行10-i-1次比较
{
if (ar[j] > ar[j + 1])//前面的数比后面的数大则两数交换
{
int tem = ar[j];
ar[j] = ar[j + 1];
ar[j + 1] = tem;
}
}
}
printf(“排序后的结果为：\n”);
for (int i = 0; i < N; ++i)
{
printf("%d", ar[i]);
}
return 0;
}