论文部分内容阅读
The sorting method of base distribution and linking is presented. Its algorithm description, time complexity and experimental results in C are given. Its proved by algorithm analysis and experimental results that its time complexity is O(N) and it has