Bucket Sort

Bucket Sort assumes that the input values are uniformly distributed over the range [0,1), 0 $\leq$ x < 1.

Procedure:

• Divide inputs into n equal-sized subintervals (buckets) over the range [0,1).

  
  

  
  

• Sort buckets and concatenate the buckets.

  
  

  
  

• T(n) = O(n)