Comment on “self-indexed sort”

2 A Textbook algorithm. The author claims that the algorithm is new. However, the same algorithm (but with correct analysis) can be found in many basic text books. Aho, Hopcroft and Ullman call the algorithm bucket sorting ([ 1, pp. 77-78]) or bin sorting ([2, pp. 274-277]). Cormen, Leiserson, and Rivest call the algorithm counting sort ([3, pp. 176-177]). They also mention that it is stable. Sedgewick calls the algorithm distribution counting ([4, pp. 111-113]). He also mentions that the algorithm is stable. Weiss calls the algorithm bucket sort ([6, p. 243]).

[1]  Sunny Y. Wang,et al.  A new sort algorithm: self-indexed sort , 1996, SIGP.

[2]  Mark Allen Weiss,et al.  Data structures and algorithm analysis , 1991 .

[3]  P. Gács,et al.  Algorithms , 1992 .

[4]  Alfred V. Aho,et al.  The Design and Analysis of Computer Algorithms , 1974 .

[5]  John Beidler,et al.  Data Structures and Algorithms , 1996, Wiley Encyclopedia of Computer Science and Engineering.

[6]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .