📄️ Parallel Merge Sort
Divide and conquer are all reduce pattern. And thus, when it comes to parallel sorting, the first thing we come to is the merge sort as a parallel divide-and-conquer.
📄️ Bitonic Sort
Bitonic Sort is an algorithm designed based on merge sort. It is capable of achieving $O((\log n)^2)$ complexity.