GeezerVison is showing github.com — interview/Algorithm/QuickSort.h at master · unMajorce/interview

Expand file tree

QuickSort.h

Copy path

More file actions

29 lines (27 loc) · 666 Bytes

Copy path

29 lines (27 loc) · 666 Bytes

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

// 快速排序

void QuickSort(vector<int>& v, int low, int high) {

if (low >= high) // 结束标志

return;

int first = low; // 低位下标

int last = high; // 高位下标

int key = v[first]; // 设第一个为基准

while (first < last)

{

// 将比第一个小的移到前面

while (first < last && v[last] >= key)

last--;

if (first < last)

v[first++] = v[last];

// 将比第一个大的移到后面

while (first < last && v[first] <= key)

first++;

if (first < last)

v[last--] = v[first];

}

// 基准置位

v[first] = key;

// 前半递归

QuickSort(v, low, first - 1);

// 后半递归

QuickSort(v, first + 1, high);

}