长记录数据的映射链接排序算法研究

SORTING METHOD BY MAPPING AND LINKING ABOUT LONG RECORDS DATA

本文针对现有排序方法处理大规模长记录数据的应用局限性 ,提出了一种谓之映射链接的新排序方法 (以下简称为“映射链接排序”) ,给出了该排序算法的描述、时间复杂度分析及用 C语言编写程序进行算法比较的实验结果 .算法分析和实验结果都表明 :映射链接排序方法与待排序数据分布情况无关 ,其时间复杂度仅为 O(N) ;对于大规模长记录数据的排序 ,其速度远远优于 Quick Sort、Flash Sort、分段快速排序等算法 .

A new sorting method about long records data, the method of mapping and linking is presented. Its algorithm description, time complexity and experimental results in C are given. It's proved by algorithm analysis and experimental results that its time complexity is O(N) and it is obviously quicker than that of quick sort etc.