BucketSort

Bucket sort is mainly useful when input is uniformly distributed over a range. For example, consider the following problem.
Sort a large set of floating point numbers which are in range from 0.0 to 1.0 and are uniformly … More on Bucket Sort
 

1
Question 1
What is the worst case performance for bucket sort?
A
O(n)
B
O(n logn)
C
O(n^2)
D
O(1)
BucketSort    
Discuss it


There is 1 question to complete.
1

 

Coding practice for sorting

 



My Personal Notes arrow_drop_up


Writing code in comment? Please use ide.geeksforgeeks.org, generate link and share the link here.