基于概率分布的排序算法(1)

A Sorting Algorithm on Probability Distribution(1)

该文根据大多数统计数据都服从某一概率分布的特性,在排序时不需要用传统的比较排序算法,而是根据其密度函数构造出一个序号函数,运用该函数可以很快计算出每个数据所排的位置。其排序速度大大快于QUIKSORT等比较排序算法,时间和空间的耗费真正达到了O(n)。

Based on the characteristics of certain probability distri bu tion,which most statistical data follow,this paper demonstrates that the tradi tional sorting algorithm is not preferred,instead a serial number function is e stablished from their density function.By using this function the position of each datum can be quickly calculated.The sorting speed is much quicker than met hods such as QUICKSORT,the cost of running time and space actually reaches O( n).