Name
Abstract | ||
|---|---|---|
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 log2n), 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 |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/ICCI.1993.315403 | Sudbury, Ont. |
Keywords | DocType | ISBN |
computational complexity,parallel algorithms,sorting,2d grid structure,column-wise order,heapsort,hybrid sorting algorithm,hybridsort,input data presortedness,internal sorting,linear list,modified quicksort,parallel processing,parallelism granularity,preprocessing phase,randomly placed input data,row-wise order,sort time complexity,square grid | Conference | 0-8186-4212-2 |
Citations | PageRank | References |
0 | 0.34 | 2 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Kok-Phuang Tan | 1 | 0 | 0.34 |
| Ghim-Hwee Ong | 2 | 14 | 3.89 |
| Seng-Chuan Tay | 3 | 0 | 0.34 |