Key Set's Sorting for Constructing Minimal Perfect HASH Function

In this paper,key set's queue-sorting and fill-sorting have been improved and presented based on reference(1).As a consequence,the key set's frequency characteristic and the first and last characters queue characteristic will be kept relatively in all sortings.The backtracking method can be quite limitized and normalized to construct minimal perfect HASH function.It is very evident that the distance of backtracking will be abridged,the computing complexity will be decreased and the quality of HASH function constucted will be improved.The typical utility PASCAL program and concrete example key set's sorting results are shown too in this paper.