//冒泡排序
#include <stdio.h>
#define N 10
void main()
{
int i,j,t,k=0;
int a[N]={94,62,57,48,73,81,81,11,33,1};
printf("origin data:\n");
for(i=0;i<N;i++)
{
printf("%d,",a[i]);
}
for(i=0;i<N-1;i++)
{
for(j=0;j<N-1-i;j++)
{
if(a[j]>a[j+1])
{
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
printf("\n");
printf("The sorting result is:\n");
for(i=0;i<N;i++)
{
printf("%d,",a[i]);
}
printf("\n");
}