STUDY ON THE ALGORITHM OF SUPER QUICK SORT FOR RANDOM INTEGERS’ SEQUENCE
Baosheng Wang · Journal of Nanyang Institute of Technology · 2010
An algorithm of super quick sorting is proposed based on hash function in the paper.According to the incremental characteristic of the array subscript,effective hash function is established for any integer sequence to sort,and the sorting is completed by mapping and linking repeatedly.Time and space complexity is analyzed.And algorithm’s efficiency is verified by experiments.The results show that the algorithm’s complexity of time and space is O(n).And algorithm’s efficiency improves obviously when the scale of the problem is large.