桶排序：A[1...n]是一个在合理的范围内的n个数的序列，例如1...m中所有的数，这里m是一个与n相比 不太大的数，这些数被放到k个桶中，第一个桶放1到[m/k]间的数，第2个桶放[m/k]+1到[2m/k]间的数，如此等等。之后将每个桶里的数用insertsort排序即可得到排好序的数组。-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.