一个高效散列排序算法

An Effective Hash Sorting Algorithm

文中给出一个Ｈａｓｈ函数及在２Ｎ空间中进行散列排序的算法。证明最该Ｈａｓｈ函数的存在和单调性，算法在装载因子为１／２的条件下具有Ｏ（Ｎ）的时间复杂性。给出一组随机数据和用不同算法进行排序的比较，测试结果表明，该算法是高效的。

In this paper we will present a Hash function and describe the Hash sorting algorithm in 2 * N space. We have proved the existence of Hash function, its monotonicity and the time complexity O (N) under the condition of 1/2 load factor. With a group of data we compared the complexity of a few different sorting algorithms. The results tested con- firms that Hash sorting algorithm is effective.