PA of Algorithms Q102

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

Option : C
Explanation :
Time complexity of radix sort is = O(nd)
Where n = keys, d = maximum digit in keys.
= d = log (n^k)
O(nd) = O(n * k logn)
= k × O (nlogn)
= O(nlogn)

Forgot your password?

I agree with the Terms.