代码
#include <iostream>
#include <stdint.h>
#include <vector>
using namespace std;
void quicksort(vector<int>& arr, int left, int right){
if (left > right)
return;
int base = arr[left];
int i = left, j = right;
while (j > i){
while (arr[j] >= base && j > i){
j--;
}
while (arr[i] <= base && j > i){
i++;
}
if (j > i){
int temp = arr[i];
arr[i] = arr[j];
arr[j] = temp;
}
}
arr[left] = arr[i];
arr[i] = base;
quicksort(arr, left, i - 1);
quicksort(arr, i + 1, right);
}
void main(){
int n;
cin >> n;
vector<int> arr;
while (n--){
int temp;
cin >> temp;
arr.push_back(temp);
}
quicksort(arr, 0, arr.size() - 1);
for (auto i : arr){
cout << i << ' ';
}
cout << endl;
}
结果
![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/59387c974b75cf9730a0268d2cecfb5f.png)