摘要
提出一种哈希函数分档的排序算法。根据数组下标递增的特点,针对任意分布整数,建立有效的哈希函数,通过反复映射完成排序。分析算法的时间和空间复杂度,实验验证算法的运行效率。算法分析和实验结果表明:算法的时间和空间复杂度均为O(n),在问题规模较大时,效率优势明显。
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.
出处
《计算机与现代化》
2010年第10期47-49,共3页
Computer and Modernization
基金
南阳理工学院青年基金资助项目(NYLGQN20070101)
关键词
哈希函数
排序
算法
复杂性
Hash function
sort
algorithm
complexity
