Description: Bucket sort: A [1 ... n] is a reasonable range of the sequence of n numbers, for example, 1 ... m all the numbers, where m and n is a number not too large compared to, these numbers are placed in k-bucket, a bucket to put the first one to [m/k] between the number, the first two buckets to put [m/k] 1 to [2m/k] between the number, and so on. After the number of each bucket sort can be obtained with insertsort sorted array.
To Search:
File list (Check if you may need any files):
bucket.cpp
Download