冒泡排序

 1 #include<stdio.h>
 2 int main() {
 3     int n, i = 0,  a[100], j, temp;
 4     scanf("%d", &n);
 5     int biao = n; 
 6     while (biao--) {
 7         scanf("%d", &a[i++]);
 8     }
 9     for (i = n - 1; i >= 0; i--) {
10         for (j = n - 1; j > 0; j--) {
11             if (a[j] < a[j - 1]) {
12                 temp = a[j];
13                 a[j] = a[j - 1];
14                 a[j - 1] = temp;
15             }    
16         } 
17     }
18     while (n--) {
19         printf("%d ", a[i++]);
20     }
21 }