#include <stdio.h>
int main(int argc, char const *argv[])
{
int ar[10];
int i, j;
int temp;
int flag;
printf("Enter 10 integers:\n");
for (i=0; i<10; i++)
{
scanf("%d", &ar[i]);
}
for (i=0; i<10; i++)
{
flag = 0;
for (j=0; j<9-i; j++)
{
if (ar[j]>ar[j+1])
{
temp = ar[j];
ar[j] = ar[j+1];
ar[j+1] = temp;
flag = 1;
}
}
if (flag == 0)
break;
}
for (i=0; i<10; i++)
{
printf("%d ", ar[i]);
}
return 0;
}
2014.2.25 改进型冒泡排序 improved bubble sort algorithm
最新推荐文章于 2018-09-24 09:15:07 发布