用冒泡排序法对一个数组排序

#include

#defineN15
intmain()
{inta[N]={5,6,2,1,9,0,3,7,89,34,76,89,93,57,34},i,j,t;        //数组已有N个数据
for(i=0;ifor(j=0;jif(a[j]>a[j+1])            //若相信的元素大小顺序不对，就交换
{t=a[j];a[j]=a[j+1];a[j+1]=t;}
for(i=0;iprintf("%d",a[i]);
printf("\n");
return0;
}