冒泡排序
#include<iostream>
#include<vector>
using namespace std;
void bubbleSort(vector<int> &arr){
for(int i = 0; i < arr.size() - 1; ++i){
for(int j = 0; j < arr.size() - 1 - i; ++j){
if(arr[j] > arr[j + 1])
swap(arr[j], arr[j + 1]);
}
}
}
int main(){
vector<int> arr{10, 9, 7, 8, 6, 5, 2, 4, 3, 1};
bubbleSort(arr);
for(auto each : arr)
cout << each << " ";
cout << endl;
return 0;
}