If we use Radix Sort with a fixed radix (base independent of n) to sort n…
PYQ GATE 2008Modified — slightly modified from the official paper; see the solution
If we use Radix Sort with a fixed radix (base independent of n) to sort n integers in the range (nk/12, nk], for some k > 0 that is independent of n, what is the asymptotic time taken?
- A.
Θ(n)
- B.
Θ(kn)
- C.
Θ(nlogn)
- D.
Θ(n2)
Attempted by 289 students.
Sign up free to check your answer
Sign up freeLoading lesson…