二次分“档”链接排序算法分析

ANALYSIS OF THE SORTING METHOD BY TWICE GRADING AND LINKING

“一种新的二次分‘档’链接排序算法”一文首先以随机无符号整数为基础 ,证明在一定条件下 ,这种新的排序算法具有 O(n)时间复杂度 ,然后在没有给出证明的情况下 ,将算法的适用范围推广到任意数据 .对这种新的排序算法进行了深入研究 ,指出了原文中的几点错误 ,并就随机无符号整数序列和随机无符号实数序列两种情况 ,分别给出了二次分“档”过程的理论分析 ,证明这种新的排序算法不适用于随机无符号实数序列 .

A paper titled “a new sorting method by twice grading and linking” has been published. It first proves that with the random unsigned integer sequence, the new sorting method has a time complexity of O(n) under certain condition, and then it is concluded that the method is applicable to any data without proof. After studying the new sorting method thoroughly, It is pointed out that there are some errors in the original paper. A theoretical analysis of the twice grading process in the cases of random unsigned integer sequence and random unsigned real number sequence is presented, and it is proved that the new sorting method can not be applied to the random unsigned real number sequence.