Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/99528
Title: HYBRID SORTING TECHNIQUES IN GRID STRUCTURES.
Authors: Tan, K.P. 
Leong, H.W. 
Issue Date: 1985
Citation: 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.
URI: http://scholarbank.nus.edu.sg/handle/10635/99528
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

45
checked on Nov 16, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.