GATE | IT | 2008 | Algorithms | Searching & sorting | Question 41

Last Updated :
Discuss
Comments

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

Θ(n)

Θ(kn)

Θ(nlogn)

Θ(n2)

This question is part of this quiz :

Top MCQs on Complexity Analysis of Algorithms with Answers,Top MCQs on Sorting Algorithms with Answers,Top MCQs on RadixSort Algorithm with Answers,Gate IT 2008,Top 50 Algorithms MCQs with Answers
Tags:
DSA Quiz
GATE
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy