Quick insertion sort
Tang Kaishan · Jisuanji gongcheng yu sheji · 2003
This paper puts forward to a sort method of quick insertion through trying to shorten the length of insertion sequence. It also provides the algorithmic idea, the algorithmic description, the algorithmic analysis and the experiment result. The theoretical significance is that the time complexity of straight insertion sort have been improved, and the practical value is that the sort efficiency have been improved about 43% more than straight insertion sort.