题目链接:https://leetcode-cn.com/problems/sort-an-array/
题目如下:
![在这里插入图片描述](https://img-blog.csdnimg.cn/7dfaf448eca845a499e3b2307d64f2a8.png?x-oss-process=image/watermark,type_d3F5LXplbmhlaQ,shadow_50,text_Q1NETiBASkluZ2xlczEyMw==,size_20,color_FFFFFF,t_70,g_se,x_16)
class Solution {
public:
vector<int> sortArray(vector<int>& nums) {
quicksort(nums,0,nums.size()-1);
return nums;
}
void quicksort(vector<int>& nums,int l,int r){
if(l>=r) return;
int i=l-1,j=r+1;
int partval=nums[(i+j)>>1];
while(i<j){
do i++;while(nums[i]<partval);
do j--;while(nums[j]>partval);
if(i<j) swap(nums[i],nums[j]);
}
quicksort(nums,l,j);
quicksort(nums,j+1,r);
}
};