程序:main() i int a [11; Int 1,],t; printf(" please input 10 n:n") for(i=1;i<=10;,i++) scanf("%d",&a) printf("n") for(i=1;i<=9;i+) for(=计+1;j=10;j++) if(ai]aLD
程序: main ( ) { int a [11]; int i, j, t; printf (" please input 10 n~:\n "); for (i=1; i<=10; i++) scanf(" %d ", &a[i]); printf(" \n "); for (i=1; i<=9; i++) for (j=i+1; j<=10; j++) if (a[i]>a[j])
ita]; a=al]; al]=t; printf ("the sorted numbers: n ") for(i=1;i<=10;,计+) printf("%d",a[D) 另一种排序法:冒泡排序法
{ t=a[i]; a[i]=a[j]; a[j]=t;} printf (" the sorted numbers: \n "); for (i=1; i<=10; i++) printf(" %d ", a[i]); } 另一种排序法：冒泡排序法