By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kok-Phuang Tan ; Dept. of Inf. Syst. & Comput. Sci., Nat. Univ. of Singapore, Singapore ; Ghim-Hwee Ong ; Seng-Chuan Tay

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

Published in:

Computing and Information, 1993. Proceedings ICCI '93., Fifth International Conference on

Date of Conference:

27-29 May 1993