摘要
本文提出了一种基于统计的快速排序算法 ,并对该算法的时间复杂度和空间复杂度进行了分析 .该算法要求排序关键字满足一定的约束条件 ,其时间复杂度为 O(n) .对该算法做一些简单的修改 ,还可以将其推广到对一般关键字的排序问题 .
This paper presents a rapid sorting algorithm to arrange the order based on statistics, and analyses the space and time complexities. This algorithm requires that the key words to be arranged in order meet some restrictive conditions. Its time complexity is O(n). It can also be used in sorting out the general key words when it is simply revised.
出处
《小型微型计算机系统》
CSCD
北大核心
2002年第11期1403-1405,共3页
Journal of Chinese Computer Systems
