UGC-NET | UGC NET CS 2015 Dec – III | Question 18

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(d n k)
(B) O(d n^k)
(C) O((d +n) k)
(D) O(d (n + k))


Answer: (D)

Explanation:

Quiz of this Question

My Personal Notes arrow_drop_up

Save