直接插入排序

直接插入排序

1

并在其中思考利用直接插入排序算法对查询结果进行排序。关键字：录入，查询，修改，排序。

And in among pondered the use direct insertion sort algorithm carries on the arrangement to the inquiry result .
2

基于此，本文提出了一种由分“档”、整体置换和局部直接插入排序所组成的新排序算法&分“档”置换插入排序法。

In this paper , a new sorting algorithm consisted of classification , in situ permutation and straight insertion is presented .
3

然后利用信息熵原理分析了插入排序和归并排序的效率，指出当序列长度大于4时，任何直接插入排序的比较次数大于理论下界。

Then the efficiency of the insertion sort and merging sort algorithms are analyzed by means of entropy , and it is pointed out that when the length of the series is larger than 4 , any sorting algorithm based on direct comparison requires more comparisons than the lower bound .