GATE | Gate IT 2008 | Question 41

If we use Radix Sort to sort n integers in the range (n^k/2,n^k], for some k>0 which is independent of n, the time taken would be?

(A)

Θ(n)

(B)

Θ(kn)

(C)

Θ(nlogn)

(D)

Θ(n²)

Answer: (C)
Explanation:

Radix sort time complexity = O(w*n)
for n keys of word size = w 
=>w = log(n^k) 
O(w*n) = O(k*log(n).n) 
=> kO(n*log(n))

Quiz of this Question
Please comment below if you find anything wrong in the above post