A Rapid Sorting Algorithm to Arrange the Order Based on Statistics
Zhanxin Ma · Mini-micro Systems · 2002
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.