冒泡排序

#include <stdio.h>
int main()
{
    int a[10]={10,1,2,6,7,8,9,3,4,5};
    int n = 10;
    for(int i = 1; i <= n-1; i++)
        for(int j = 0; j < n - i; j++){
            if (a[j] > a[j+1]){
                int temp = a[j+1];
                a[j+1] = a[j];
                a[j] = temp;
            }
        }
    for (int i = 0; i < n; i++)
        printf("%d ", a[i]);
}