冒泡排序

#include <iostream> using namespace std; int main() { int a[11]; int i, j, t; cout << "input 10 numbers:" << endl; for (i = 1; i < 11; i++) cin >> a[i]; cin.get(); cout << endl; for(j=1;j<=9;j++)//共进行9轮比较 for(i=1;i<10-j;i++)//在每轮中要进行(10-j)次两两比较 if (a[i] > a[i + 1])//如果前面的数大于后面的数 { t = a[i]; a[i] = a[i + 1]; a[i + 1] = t;//交换两个数的位置，使小数上浮 } cout << "the sorted numbers: " << endl; for (i = 1; i < 11; i++) cout << a[i] << " "; cout << endl; system("pause"); return 0; }