Studies on the Efficiency of Certain Internal Sort Algorithms

摘要

Four previous studies related to internal sorting are reviewed in this summary paper. The first study introduced a new family of modified merge sort algorithms called insertion merge sort algorithms. The second examined various properties of heapsort, including development of a new modification d-heapsort with better worst case performance than the ordinary heapsort. The third presented a heuristic approximation of the worst case of Shellsort. In the final study the most common internal sort algorithms were studied with respect to the prospects for speeding them up by replacing the inner loops of the algorithms with special microprogrammed instructions.