Amir Baserinia
Results
2
comments of
Amir Baserinia
It uses quick sort! Basically, it splits a vector into a few sub-vectors, then each sub-vector is sorted sequentially using `std::sort` in a separate thread. Finally the results are merged....
Sure! I will add some instructions as how to build it using make. If I get a chance, I will also add a cmake config file for people who prefer...