Radix sort wrong time complexity. #49
Description
"Radix sort is a linear time sorting algorithm that sort in O(n+k) time when elements are in range from 1 to k."
The time complexity is O(n*k), O(n+k) is space complexity.
{{ message }}
"Radix sort is a linear time sorting algorithm that sort in O(n+k) time when elements are in range from 1 to k."
The time complexity is O(n*k), O(n+k) is space complexity.