改进版的冒泡排序法(c语言)

#include "stdio.h"

#define N 10

main()

{

int i,j,temp,a[N];

int count=0;

int flag=1;

int k=1;

printf("please input %d datas:\n",N);

for(i=0;i

{ printf("%d:",k);

scanf("%d",&a[i]);

k++;

}

printf("*****排序过程****\n");

for(i=0;i

{flag=0;

for(j=0;j

if(a[j]>a[j+1])

{temp=a[j];a[j]=a[j+1];a[j+1]=temp;

flag=1;}

count++;

printf("%d : ",count);

for(j=0;j

printf("%3d",a[j]);

printf("\n");

}

printf("最终排序为：\n");

for(i=0;i

printf("%3d",a[i]);

printf("\n");

}