冒泡排序

void test11(){
    int a[10],i,j,t;
    for (i=0; i<</span>10; i++) {
        scanf("%d",&a[i]);
    }
    for (j=0; j<</span>9; j++) {
        for (i=0; i<</span>9-j; i++) {
            if (a[i]>a[i+1]) {
                t=a[i];
                a[i]=a[i+1];
                a[i+1]=t;
            }
        }
    }
    for (i=0; i<</span>10; i++) {
        printf("%d\t",a[i]);
    }
}