Hark data structure and algorithm practice library sort

Algorithm description

Library sorting is a variant of the insertion sequence, typically a method of space-time change. I personally feel that this kind of thinking can be learned, but the direct use of the scene should be small.

We know that the actual insertion sort is usually followed by inserting elements forward, and we're going to move back all the elements behind. The idea of library sorting is to reserve n space behind each element (for example, reserving 10 element spaces) so that when inserted before an element, only a few fewer elements will be moved under the pre-reserved space.

Code

Because April to test, so the code is not written, and later when there is time to fill in

Reference

Http://www.cnblogs.com/kkun/archive/2011/12/05/2276411.html

Hark data structure and algorithm practice library sort