Hybrid Sorting Techniques in Grid Structures

  • K. P. Tan
  • H. W. Leong


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.


Grid Point Grid Structure Sorting Algorithm Triangular Grid Sort Time 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Bo]
    J. Boothroyd, Algorithm 201: Shellsort, Comm. ACM 6 8, August 1963, pp. 445.CrossRefGoogle Scholar
  2. [CK]
    C.R. Cook and Do Jin Kim, Best Sorting Algorithms for Nearly Sorted Lists, Comm. ACM 23 11, November 1980, pp. 620–624.CrossRefGoogle Scholar
  3. [Fr]
    Greg N. Frederickson, Implicit Data Structures for the Dictionary Problem, JACM 30 1, January 1983, pp. 80–94.CrossRefMATHGoogle Scholar
  4. [Ho]
    C.A.R. Hoare, Algorithm 63 (Partition) -64 (Quicksort) -65 (Find), Comm. ACM 4 7, July 1961, pp. 321–322.CrossRefGoogle Scholar
  5. [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
  6. [Kn]
    D.E. Knuth, “The Art of Computer Programming”, Vol. 3, Sorting and Searching, 2nd ed., Addison-Wesley, Reading, Massachusetts, 1973.Google Scholar
  7. [Lo]
    H. Lorin, “Sorting and Sort Systems”, Addison-Wesley, Reading, Massachusetts, 1975MATHGoogle Scholar
  8. [MS]
    J. Ian Munro and Hendra Sawanda, Implicit Data Structures for Fast Search and Update, Journal of Computer and System Sciences 21 2, October 1980, pp. 236–250.MathSciNetCrossRefMATHGoogle Scholar
  9. [Si]
    R.C. Singleton, Algorithm 347 (An Efficient Algorithm for Sorting with Minimal Storage), Comm. ACM 12 3, March 1969, pp. 185–187.CrossRefGoogle Scholar
  10. [Wi]
    J.W.J. Williams, Algorithm 232 (Heapsort), Comm. ACM 7 6, June 1964, pp. 347–348.Google Scholar

Copyright information

© Plenum Press, New York 1987

Authors and Affiliations

  • K. P. Tan
    • 1
  • H. W. Leong
    • 2
  1. 1.Dept. of Information Systems and Computer ScienceNat. Univ. of SingaporeKent Ridge, SingaporeSingapore
  2. 2.Dept. of Comp. Sci.Univ. of Illinois at Champaign-UrbanaUrbanaUSA

Personalised recommendations