| 5 | namespace PS { |
| 6 | template<typename T, class Fn> |
| 7 | void parallelSort(T* data, size_t len, size_t grainsize, const Fn& cmp) { |
| 8 | if (len <= grainsize) { |
| 9 | std::sort(data, data + len, cmp); |
| 10 | } else { |
| 11 | std::thread thr(parallelSort<T, Fn>, data, len/2, grainsize, cmp); |
| 12 | parallelSort(data + len/2, len - len/2, grainsize, cmp); |
| 13 | thr.join(); |
| 14 | |
| 15 | std::inplace_merge(data, data + len/2, data + len, cmp); |
| 16 | } |
| 17 | } |
| 18 | |
| 19 | // cmp typically is [](const T& a, const T& b) { return a < b; } |
| 20 | // or an even simplier version: std::less<T>() |
no test coverage detected