快速排序

#include<iostream>
#include<vector>
using namespace std;
class solution
{
public:
void quick_sort(vector<int>& nums,int L,int R)
{
int M = (L + R) / 2;
int i = L;
int j = R;
int temp = nums[M];
while (i<=j)
{
while (nums[i] < temp)
{
i++;
}
while(nums[j]>temp)
{
j--;
}
if (i <= j)
{
int temp1 = nums[i];
nums[i] = nums[j];
nums[j] = temp1;
i++;
j--;
}
}
//相同的两个子问题继续求解
if (j > L)
{
quick_sort(nums, L, j);
}
if (i < R)
{
quick_sort(nums, i, R);
}
}
};
int main()
{
int n;
cin >> n; 
vector<int> nums;
for (int i = 0; i < n; i++)
{
int temp;
cin >> temp;
nums.push_back(temp);
}
solution s;
s.quick_sort(nums, 0, nums.size() - 1);
for (int i = 0; i < nums.size(); i++)
{
cout << nums[i]<<' ';
}
return 0;
}