Bucket Sort

Internal

• Sorting Algorithms

Overview

TODO CLRS page 200.

Require knowledge of the probabilistic distribution of the number in the input array. It can sort n real numbers uniformly distributed in the half-open interval [0, 1) in average-case O(n) time.

Worst-case time	Θ(n2)
Average-case time	Θ(n))
Best-case time