An Introduction to Three Algorithms for Sorting in Situ
暂无分享,去创建一个
The purpose of this paper is to give a crisp introduction to three algorithms for sorting in situ, viz. insertion sort, heapsort and smoothsort. The more complicated the algorithm, the more elaborate the justification for the design decisions embodied by it. In passing we offer a style for the presentation of non-trivial algorithms that seems to have its merits.
[1] Niklaus Wirth,et al. Algorithms + Data Structures = Programs , 1976 .
[2] Edsger W. Dijkstra,et al. Smoothsort, an Alternative for Sorting In Situ , 1982, Sci. Comput. Program..