 This creates "n"/8 "buckets" to which the remaining 7/8 of the items are distributed.Each "bucket" is then sorted, and the "buckets" are concatenated into a sorted array.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.