Results

**1 - 1**of**1**### Comment on Self-Indexed Sort

, 1996

"... in the third phase. Hence, the cost of Self-Indexed Sort is \Theta(n +m). 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 ([ ..."

Abstract
- Add to MetaCart

in the third phase. Hence, the cost of Self-Indexed Sort is \Theta(n +m). 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 Lund University, Lund, Sweden y Lulea University, Lulea, Sweden, and IMFM, Ljubljana, Slovenia counting ([4, pp. 111--113]). He also mentions that the algorithm is stable. Weiss calls the algorithm bucket sort ([6, p. 243]). There are minor differences in implementation between the t