PA of Algorithms Q98

98Following algorithm (s) can be used to sort n integers in the range [1... n³] in O(n) time?

Option : D
Explanation :
Radix sort is counting based sorting technical the time complexity is Q(n).

Forgot your password?

I agree with the Terms.