Sorting by Insertion
Keith McLuckie, Angus Barber · 1986
The sorts covered previously have shown how an input list may be sorted using counting, selection and exchanging techniques. The sorts contained in this and the next chapter will not improve upon the time achieved by the Quicksort but will demonstrate other methods of sorting, possibly not as obvious as the exchange and counting techniques already demonstrated. Although the sorts may not be faster, they do have advantages associated with them that might make them a better choice than some of the exchange sorts in some applications.