冒泡排序
#include<iostream>
using namespace std;
int main() {
int arr[9] = { 4,8,1,7,5,6,9,3,2 };
cout << "before:" << endl;
for (int i = 0; i < 9; i++) {
cout << arr[i] << " ";
}
for (int i = 0; i < 9 - 1; i++) {
for (int j = 0; j < 9 - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j+1] = temp;
}
}
}
cout << "after:" << endl;
for (int i = 0; i < 9; i++) {
cout << arr[i] << " ";
}
return 0;
}