摘要
提出一种4路插入的排序方法。给出了算法思想、算法描述、算法分析和实验结果。其理论意义是改进了一类时间复杂度为O(N2)排序法的时间复杂度,其实用价值是该排序法在一类时间复杂度为O(N2)排序法中排序效率较高的,其平均排序速度比直接插入排序法、选择排序法、冒泡排序快66%以上。
This paper puts forward a four-way insertion sort method, gives its algorithmic ideas, algorithmic description, its algorithmic analysis, and its experimental results. The theoretical significance lies improved time complexity of the sorts whose time complexity is Of N-^2. Its practical value is the more efficient sorting method in the sort of a class whose complexity is Of N^2）, the average sorting speed is faster at 66% than straight insertion and selection and bubble sort.
出处
《计算机工程》
EI
CAS
CSCD
北大核心
2006年第1期51-53,共3页
Computer Engineering
关键词
插入
4路插入
排序
算法复杂度
Insert
Four-way insertion
Sort
Algorithmic complexity
