2 votes 2 votes Assuming there are n keys and each key is in the range [0, m-1]. The run time of bucket sort is O(n) O(n lgn) O(n lgm) O(n+m) Algorithms ugcnetcse-dec2013-paper3 algorithms sorting + – go_editor asked Jul 28, 2016 go_editor 2.0k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
2 votes 2 votes Assuming there are n keys and each key is in the range [0, m-1]. The run time of bucket sort is O(n). refer: http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/Sorting/bucketSort.htm Prashant. answered Jul 28, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Ans: D Best and Avg. case= O(n+m) worst case= O(n^2) rishu_darkshadow answered Aug 30, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.