在计算机内部排序的各种算法中 ,用比较大小的方法进行排序时间耗费的最好特性为 O(nlog2 n) ,最坏情况下还会上升到 O(n2 ) [1] 。要达到其理论下界log2 n1≈ nlog2 n- 1.4 4 n是非常困难的。Hashsort 一种散列排序方法-The best features of the computer' s internal sorting algorithm, the sort of time-consuming method of comparative size O (nlog2 n), the worst case will rise to the O (n2) [1]. To achieve its theoretical Lower Bound log2 N1 ≈ nlog2 N-1.4 4 n is very difficult. The Hashsort sort of a hashing method