Description: Bucket sort, or bin sort, is a sorting algorithm that works by partitioning an array into a number of buckets. Each bucket is then sorted individually, either using a different sorting algorithm, or by recursively applying the bucket sorting algorithm. It is a distribution sort, and is a cousin of radix sort in the most to least significant digit flavour. Bucket sort is a generalization of pigeonhole sort. Since bucket sort is not a comparison sort, the O(n log n) lower bound is inapplicable. The computational complexity estimates involve the number of buckets.
To Search:
File list (Check if you may need any files):
Bucket_Sort\bin\Debug\Galeata.exe
...........\Galeata.cbp
...........\Galeata.depend
...........\Galeata.layout
...........\main.c
...........\obj\Debug\main.o
...........\bin\Debug
...........\obj\Debug
...........\bin
...........\obj
Bucket_Sort
Download