看了《啊哈!算法》后觉得图解很不错,附上图解
图解
C++代码
#include <algorithm>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
//前面这一对头文件是因为我经常练习链表,栈就没删
using namespace std;
void quickSort(vector<int> &array, int left, int right) {
if (left > right)
return;
int i = left, j = right;
int pivot = array[left]; //基准值
while (i != j) {
while (i < j &&