ANALYSIS OF THE SORTING METHOD BY TWICE GRADING AND LINKING

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.