Skip to Main Content
Based on insertion, Quick-Sort and Merge-Sort algorithms, this paper proposes an improved method about indexing and presents its corresponding parallel algorithm. Introduction of index table increases memory consumption but decreases consumption of record movement in sorting. The experiment demonstrates that executing CPU time of indexing based sort algorithm is evidently less than that of other sort algorithms. Based on index table and parallel computing, the Merge-Sort algorithm saved the waiting and disposal time in which every two sub-merging sequences are sorted in single processor computer. This obtained better efficiency than the original Merge-Sort algorithm.