01 冒泡排序的思想

02 冒泡排序的实现

03 例题讲解

#include <iostream>
using namespace std;
void bubbleSort(int arr[], int n) {for (int i = 0; i < n-1; i++) {     for (int j = 0; j < n-i-1; j++) {if (arr[j] > arr[j+1]) {int temp = arr[j];arr[j] = arr[j+1];arr[j+1] = temp;}}}
}
int main() {int n;cin >> n;int treasures[n];for(int i = 0; i < n; i++) {cin >> treasures[i];}bubbleSort(treasures, n);for(int i = 0; i < n; i++) {cout << treasures[i] << " ";}cout << endl;return 0;
}