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 it...
详细信息
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.
A new sorting method, the method of code-transformation, graded computing and insertional relocations is presented. Its algorithm description, time complexity and experimental results in C are given. It’s proved by a...
详细信息
A new sorting method, the method of code-transformation, graded computing and insertional relocations is presented. Its algorithm description, time complexity and experimental results in C are given. It’s proved by algorithm analysis and ex- perimental results that its time complexity is O(N) and the new sorting algorithm is better than the quick sort etc. when data are in equidistribution.
暂无评论