Abstract: The paper brings forward a new sorting algorithm based on Hash function. According to the characteristic of the array subscript progressive increase, it establishes effective Hash function by grading to random distributed integers, and completes sorting by mapping repeatedly. Time and space complexity is analyzed, and algorithm’s efficiency is verified by experiments. Algorithm analysis and experimental results show that the algorithm’s time and space complexity is O(n). It improves obviously algorithm’s efficiency when the scale of the problem is large.

Key words: Hash function, sort, algorithm, complexity