recategorized
713 views
1 votes
1 votes

If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, …, k\right\}$, radix sort can sort the numbers in :

  1. $O (k (n + d))$
  2. $O (d (n + k))$ 
  3. $O ((n + k) l g d)$ 
  4. $O ((n + d) l g k)$
recategorized

1 Answer

Answer:

Related questions

1 votes
1 votes
4 answers
2
1 votes
1 votes
1 answer
3
makhdoom ghaya asked Oct 1, 2016
848 views
Consider a hash table of size $m = 10000$, and the hash function $h(K) = floor (m(KA \bmod 1))$ for $A = ( \sqrt{5} – 1)/2$. The key $123456$ is mapped to location ____...
2 votes
2 votes
3 answers
4
Pooja Khatri asked Jul 13, 2018
17,107 views
The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number):4572360450