lhprojects/sort2

Sort two arrays according to the order of first array (quick sort + heap sort)。根据第一个迭代器的顺序对两个迭代器进行排序（堆排序+快排）。

sort2

Sort two ranges at same time, according the order of the first range.

For example

vector a = { 3, 2, 1};
vector b = { x, y, z};
vector c = { 3, 2, 1};
sort::sort(c.begin(), c.end()); // c -> { 1, 2, 3, }
sort::sort2(a.begin(), a.end(), b.begin()); // a -> { 1, 2, 3}    b-> { z, y, x}

Implementation note

Quick sort + heap sort.

This project is implemented after reading the implementation of Visual Studio 2017. So there is copy-right risk! This project is motivated by interest.