Bucket sort can be seen as a generalization of counting sort; in fact, if each bucket has size 1 then bucket sort degenerates to counting sort.
12.
:: : This is not a quicksort but a bucket sort, and it is a good way of sorting numbered pieces of paper in my experience.
13.
:I would expect ( without proof ) that a " bucket sort " would be the best for totally random ordering with a human doing the sorting.
14.
For example, one person could do a bucket sort, as Tardis said, where they divide the pipes up into, say, 6 series of pipes.
15.
For example, using a bucket sort, you might want to first sort the 50 sheets into piles of 5 or 10 sheets each, and then sort each pile.
16.
Top-down radix sort can be seen as a special case of bucket sort where both the range of values and the number of buckets is constrained to be a power of two.
17.
Bucket sort with two buckets is very similar to quicksort; the pivot in this case is effectively the value in the middle of the value range, which does well on average for uniformly distributed inputs.
18.
:Assuming it actually is O ( n log log n ), then I think it's violating the O ( n log n ) barrier on comparison sorts by actually being a bucket sort variation.
19.
For example, if it is known that the N objects are integers from the range [ 1, N ], then they may be sorted O ( N ) time, e . g ., by the bucket sort.
20.
As for previous publication I published it on the Internet in at least 1996 and the only response I got was an email suggesting it was a bucket sort and I have never heard of a counting sort prior to hearing about it here.
