Please use this identifier to cite or link to this item:
|Title:||HYBRID SORTING TECHNIQUES IN GRID STRUCTURES.|
|Authors:||Tan, K.P. |
|Source:||Tan, K.P.,Leong, H.W. (1985). HYBRID SORTING TECHNIQUES IN GRID STRUCTURES. : 320-326. ScholarBank@NUS Repository.|
|Abstract:||This paper introduces two sorting algorithms based on two grid structures, the square grid and the upper triangle grid. The n elements to be sorted are distributed over the grid points. The hybrid sorting technique in each structure comprises a bubblesort (or quicksort) with a grid heapsort. The computational complexity for both algorithms in the worst case achieves O(n**3**/**2). Explicit pointers or stacks are not used. No extra storage is required. The algorithm has some obvious properties to fit the basic concept of parallel processing. A Pascal program for the square grid algorithm is attached.|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Apr 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.