摘要
提出了适用于多种排序法的带索引排序和基于带索引排序方法的记录环移动算法,并对所提算法复杂度进行了分析。实验结果表明,在一定条件下,带索引排序方法使算法的时间复杂度有明显的改进。
The paper presents the sort with index adapting many sort methods and the ring shift algorithm of records based-on the sort with index, and analyzes the complexities of the corresponding algorithms. The experiments show that time complexity of the sort-with-index is better than current sort algorithms under certain conditions.
出处
《江苏技术师范学院学报》
2007年第4期34-37,共4页
Journal of Jiangsu Teachers University of Technology
关键词
排序
索引
算法复杂度
sort
index
algorithm complexity