1 votes 1 votes If there are $n$ integers to sort, each integer has d digits, and each digit is in the set $\left\{1, 2, …, k\right\}$, radix sort can sort the numbers in : $O (k (n + d))$ $O (d (n + k))$ $O ((n + k) l g d)$ $O ((n + d) l g k)$ DS ugcnetcse-aug2016-paper3 data-structures radix-sort + – makhdoom ghaya asked Oct 1, 2016 recategorized May 23, 2020 makhdoom ghaya 713 views answer comment Share Follow See 1 comment See all 1 1 comment reply vivek9837 commented Oct 2, 2016 reply Follow Share isn't that obvious O(d(n+K)) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Ans : B O(d(n+k)) rishu_darkshadow answered Aug 27, 2017 rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.