//冒泡排序法#include<iostream>using namespace std;int main (){    int i,j,t,ii;    int a[11];        //第0个元素始终没有用    cout<<"input 10 numbers:"<<endl;    for(i=1;i<11;i++){        cin>>a[i];        //输入a[1]~a[10]    }    cout<<endl;    for(j=1;j<=10;j++){        //共进行9趟比较        for(i=1;i<=11-j;i++){        //在每趟中要进行（10-j）次两两比较            if(a[i]<a[i+1]){        //如果后面的数大于前面的数                t=a[i];                a[i]=a[i+1];                a[i+1]=t;            //交换两个数的位置，使大数上浮                            }            cout<<i<<"*";        }        cout<<"array:"<<j<<endl;        cout<<"the sroted numbers:"<<endl;    for(i=1;i<11;i++){        cout<<a[i]<<" ";        //输出10个数    }    cout<<endl;    }/*    cout<<"the sroted numbers:"<<endl;    for(i=1;i<11;i++){        cout<<a[i]<<" ";        //输出10个数    }    cout<<endl;    */    system("PAUSE");    return 0;}

input 10 numbers:1 2 3 4 5 6 7 8 9 101*2*3*4*5*6*7*8*9*10*array:1the sroted numbers:2 3 4 5 6 7 8 9 10 11*2*3*4*5*6*7*8*9*array:2the sroted numbers:3 4 5 6 7 8 9 10 2 11*2*3*4*5*6*7*8*array:3the sroted numbers:4 5 6 7 8 9 10 3 2 11*2*3*4*5*6*7*array:4the sroted numbers:5 6 7 8 9 10 4 3 2 11*2*3*4*5*6*array:5the sroted numbers:6 7 8 9 10 5 4 3 2 11*2*3*4*5*array:6the sroted numbers:7 8 9 10 6 5 4 3 2 11*2*3*4*array:7the sroted numbers:8 9 10 7 6 5 4 3 2 11*2*3*array:8the sroted numbers:9 10 8 7 6 5 4 3 2 11*2*array:9the sroted numbers:10 9 8 7 6 5 4 3 2 11*array:10the sroted numbers:10 9 8 7 6 5 4 3 2 1请按任意键继续. . .