HYBRID SORTING TECHNIQUES IN GRID STRUCTURES.

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.