Bucket Sort is a non-comparative sorting algorithm that used a constrained size, \(M\), of array to put the items into accords to their bit representation from most-to-least significant.
Analysis
- It will result in \(O(N)\) in average case if \(M < N\).