Hybrid Sorting Techniques in Grid Structures
This paper introduces two sorting algorithms based on two grid struct ures, 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 0(n3/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.
Unable to display preview. Download preview PDF.
- [HL]F.K. Hwang and S. Lin, A Simple Algorithm for Merging Two Disjoint Linearly-Ordered Sets, SIAM Journal of Computing 1 1, 1972.Google Scholar
- [Kn]D.E. Knuth, “The Art of Computer Programming”, Vol. 3, Sorting and Searching, 2nd ed., Addison-Wesley, Reading, Massachusetts, 1973.Google Scholar
- [Wi]J.W.J. Williams, Algorithm 232 (Heapsort), Comm. ACM 7 6, June 1964, pp. 347–348.Google Scholar