#include <iostream>using namespace std;//冒泡排序基本原理 int main() { int a[] = { 9,8,7,6,5,4,3,2,1 }; for (int j = 0; j < 9; j++) { cout << a[j] << " "; } cout << endl; //冒泡排序基本原理,第0趟 for(int i=9-1;i>=0;i--){ if(a[i]<=a[i-1]){ swap(a[i],a[i-1]); }} for (int k = 0; k <...