小间隔数据的地址映射链接排序算法研究

THE ADDRESS MAPPING LINKING SORT FOR SPECIAL DISTRIBUTED DATA

本文结合小间隔数据的特点， 提出了一种谓之地址映射链接的新排序方法（以下简称为地址映射链接排序），给出了该排序算法的描述、时间复杂度分析及用ＰＡＳＣＡＬ语言、Ｃ 语言编写程序进行算法比较的实验结果．算法分析和实验结果都表明在待排序数据间隔不太大的情况下，

A new sorting method,the address Mapping Linking sort for special distributed data is presented.Its algorithm description, time complexity and experimental results in Pascal and C 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.