Bucket sort is most efficient in the case when __________
(a) the input is non uniformly distributed
(b) the input is uniformly distributed
(c) the input is randomly distributed
(d) the input range is large
This question was addressed to me in a national level competition.
The question is from Sorting in chapter Sorting of Data Structures & Algorithms II