摘要
结合小间隔数据的特点，提出了一种谓之迁移的新排序方法（以下简称为迁移排序），给出了该排序算法的描述、时间复杂度分析及用汇编语言编写程序进行算法比较的实验结果。算法分析和实验结果都表明在待排序数据间隔不太大的情况下，迁移排序算法在速度上明显优于快速排序算法。
A new sorting method, the method of transfer sort for special distributed data is presented. Its algorithm description, time complexity and experimental results in assembler language are given. It's proved by algorithm analysis and experimental results that the new sorting algorithm is better than the quick sort when data are in little gap distribution.
出处
《计算机工程与设计》
CSCD
北大核心
2000年第4期61-64,共4页
Computer Engineering and Design
