#include
void sort(int a[],int n)
{
int i,j;
int t;
for(i=0;i
for(j=0;j
if(a[j] {
t=a[j];
a[j]=a[j+1];
a[j+1]=t;
}
}
}
}
void print(int a[],int n)
{
int i;
for(i=0;i
printf("%d\n",a[n-1]);
}
int main()
{
int a[] = {123,145,210,815,44,240,919,310,44,88,123};
int length = sizeof(a)/sizeof(a[0]);
printf("排序前:\n");
print(a,length);
sort(a,length);
printf("排序后:\n");
print(a,length);
return 0;
}