#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
void QuickSort(vector<int>& arr, int start, int end)
{
if (start >= end)return;
int low = start;
int high = end;
int tmp = arr[low];
while (low < high)
{
while (low<high&&arr[high]>tmp)high--;
if (low < high)arr[low++] = arr[high];
while (low < high &&arr[low] < tmp)low++;
if (low < high)arr[high--] = arr[low];
}
arr[low] = tmp;
QuickSort(arr, start, low - 1);
QuickSort(arr, low + 1, end);
return;
}
int main()
{
vector<int>arr{0, 8, 4, 6, 9, 2, 3, 1, 7, 5};
int len = arr.size();
QuickSort(arr, 0,len-1);
return 0;
}
第二种:参考剑指offer;
#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
using namespace std;
void Swap(int* a, int* b)
{
int tmp = *a;
*a = *b;
*b = tmp;
return;
}
void QuickSort(vector<int>& arr, int start, int end)
{
if (start >= end)return;
int tmp = arr[start];
int minIndex = start;
for (int index = start + 1; index <= end; index++)
{
if (arr[index] < tmp)
{
minIndex++;
if (minIndex != index)Swap(&arr[minIndex],&arr[index]);
}
}
Swap(&arr[minIndex], &arr[start]);
QuickSort(arr, start, minIndex - 1);
QuickSort(arr, minIndex + 1, end);
return;
}
int main()
{
vector<int>arr{4,3,2,1,0};
int len = arr.size();
QuickSort(arr, 0,len-1);
return 0;
}