经典的快排
#include <iostream>
#include <vector>
using namespace std;
void quickSort(int left, int right, vector<int>& arr)
{
if (left>=right)//边界情况
{
return;
}
if (left<0||right>=arr.size
经典的快排
#include <iostream>
#include <vector>
using namespace std;
void quickSort(int left, int right, vector<int>& arr)
{
if (left>=right)//边界情况
{
return;
}
if (left<0||right>=arr.size