地址哈希排序算法的设计与实现

Design & Implementation of Address-Hash-Sorting Algorithm

提出一种称为地址哈希的排序算法,该算法是一种比传统快速排序算法性能高的多的排序方法,全文给出了该算法的描述、部分源程序、时间/空间复杂度分析.本算法由于具有不需要关键字比较的特点而特别适用于大数据量的排序,又由于有不需要移动元素的特点而特别适用于大记录的排序工作,并且在一定条件下还可以减少外部排序的趟数或消除外部排序,研究表明,该算法具有很高的实用价值.

In this paper, address-hash-sorting algorithm which is hig he r in performance than traditional ones has been established. The algorithm nee ds neither the keyword comparisons nor record movements. Its description, par tial source program, time and space complexity are presented. In addition, thi s algorithm can reduce external sorting times or eliminate external so rting .The experiments show it is particularly suitable to the sorting oper ation of a great quantity of data and records. The application result says it is effective and worth using.