一种基于统计的分段排序算法

A method of sectional sorting algorithm with count

模仿手工对大记录量 ,少关键字值的排序方法 ,提出一种基于统计的分段排序算法。在此基础上 ,提出一种适合一般情况的有限次统计分段排序算法。算法的时间复杂度为O(n) ,而空间占用极少 ,算法的排序速度与记录的初始分布无关。

Imitate manual sorting to a log sheet of large number records and few keyword,put a method of sectional sorting algorithm with count.After this a method of limited sectional sorting with count,fits universal situation,was put.The asymptotic time complexity of this algorithm most closely to O(n).The employ space of this algorithm is a much little constant.The performance time of this algorithm is independent of initial distribution of records.The algorithm has mush higher performance time than shell sorts,quick sorts and radix sorts.