UGC-NET | UGC NET CS 2016 Aug – III | Question 35

If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, …, k}, radix sort can sort the numbers in:
(A) O (k (n + d))
(B) O (d (n + k))
(C) O ((n + k) lg d)
(D) O ((n + d) lg k)


Answer: (B)

Explanation: If there are n integers to sort, each integer has d digits, and each digit is in the set {1, 2, …, k}, radix sort can sort the numbers in O(d (n + k)).
For more information Refer:Radix Sort
Option (B) is correct.

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.