摘要
The sorting method of base distribution and linking is presented. Its algorithm description, time complexity and experimental results in C are given. It’s proved by algorithm analysis and experimental results that its time complexity is O(N) and it has nothing to do with data distribution. The method is obviously quicker than that of quick sort, base sort and linking sort etc.
The sorting method of base distribution and linking is presented. Its algorithm description, time complexity and experimental results in C are given. It's proved by algorithm analysis and experimental results that its time complexity is O(N) and it has nothing to do with data distribution. The method is obviously quicker than that of quick sort, base sort and linking sort etc.
出处
《数值计算与计算机应用》
CSCD
北大核心
2000年第4期294-302,共9页
Journal on Numerical Methods and Computer Applications
