Register

bucket sort

• retagged by
1,003 views
1 votes
1 votes
Assuming there are n keys and
each key is in the range [0, m – 1].
The run time of bucket sort is
(A) O(n) (B) O(n lgn)
(C) O(n lgm) (D) O(n + m)
• retagged by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
2 answers
1
rahul sharma 5 asked Sep 22, 2017
875 views
Bucket sort
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets? 2. Bucket sort is always NOT inplace.Is this correct?
1. Is bucket sort always stable or does it depend on the sorting subroutine used by bucket sort toe sort the buckets?2. Bucket sort is always NOT inplace.Is this correct...
User Avatar
1 votes
1 votes
0 answers
2
rahul sharma 5 asked Dec 11, 2016
1,118 views
Bucket Sort
Does Bucket sort input is always between 0 and 1? Or the input has to be distributed between [0,1) interval uniformly before applying bucket sort?
Does Bucket sort input is always between 0 and 1?Or the input has to be distributed between [0,1) interval uniformly before applying bucket sort?
User Avatar
1 votes
1 votes
0 answers
3
aditykansara asked Jan 31, 2019
1,337 views
Can Merge Sort Time Complexity be O(n^2) in any condition?
User Avatar
1 votes
1 votes
0 answers
4
Kaushal Sanadhya asked Oct 9, 2018
3,913 views
radix sort counting sort
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time? 1)Counting Sort 2)Radix Sort 3)Bubble Sort 4)Merge Sort.
Given an array where numbers are in range from 1 to n6, which sorting algorithm can be used to sort these number in linear time?1)Counting Sort2)Radix Sort3)Bubble Sort4)...
User Avatar
Link Copied!