摘要
讨论了两种二路插入排序的方法，给出了算法思想，分析了这些方法的时间复杂度，其平均时间复杂度比直接插入排序法降低了1/2-1/2，说明这些排序方法比直接插入排序法具有较高的排序效率。
This paper discusses two methods of two - way insertion sort and its algorithmic concepts, and analyzes their time complexity. Compared with the straight insertion sort, the average time complexity of these methods is re-duced . It shows that these sort methods are more efficient than straight insertion sort.
出处
《绍兴文理学院学报（自然科学版）》
2003年第9期29-32,共4页
Journal of Shaoxing College of Arts and Sciences
