An O(n log2n) hybrid sorting algorithm on 2-D grid

The authors have designed a hybrid sorting algorithm using heapsort and a modified version of quicksort. It consists of two phases: preprocessing and sorting. In the preprocessing phase, input data are randomly placed on a square grid and sorted in column-wise order followed by row-wise order using heapsort. In the sorting phase, the preprocessed data are treated as a linear list and sorted by a modified quicksort. The sort time complexity of the hybrid method is O(n log₂n), and maintains a fairly constant value for a fixed n for any presortedness of the input data. The granularity of parallelism in the hybidsort is large, and therefore it is suitable for parallel processing