#include <iostream>
#include <algorithm>
using namespace std;
//冒泡排序
void print(int* a, int n){
for(int i=0; i<n; i++){
cout << a[i]
<< ' ';
}
cout << endl;
}
void sort(int* a, int n){
for(int i=0; i<n-1; i++){
bool flag = true;
for(int j=0; j<n-i-1;
j++){
if(a[j]>a[j+1]){
swap(a[j],a[j+1]);
/*
int k =
a[j];
a[j] =
a[j+1];
a[j+1] =
k;
*/
flag =
false;
}
}
cout << "第" << i << "次:";
print(a, 10);
if(flag) break;
}
}
int main()
{
int a[] = {9,0,1,3,2,5,6,4,7,8};
//int a[] = {9,8,7,6,5,4,3,2,1,0};
cout << "排序前:";
print(a, 10);
sort(a,10);
cout << "排序后:";
print(a,10);
}