一种新的分“档”统计插入排序算法

A NEW SORTING METHOD BY GRADING AND INSERTIONAL RELOCATION

提出了一种谓之数据代码转换、分“档”统计、迁移插入的新排序方法（以下简称为分“档”统计插入排序），给出了该排序算法的描述、时间复杂度分析及用Ｃ语言编写程序进行算法比较的实验结果．算法分析和实验结果都表明：在待排序数据均匀分布的情况下，分“档”统计插入排序方法的时间复杂度为Ｏ（Ｎ），并且排序速度明显优于快速排序、分段快速排序〔２〕、按位段分块排序〔４〕等算法．

A new sorting method, the mehtod of code transformation, graded computing and insertional relocations 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 the new sorting algorithm is better than the quick sort etc. when data are in equidistribution.