- A O(N)
- B O(log N)
- C O(N^2)
- D O(Nk), where k is the maximum number of digits in the input numbers.
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Q: How is the time complexity of the radix sort algorithm expressed?
Time Complexity
Learn More MCQ Questions from Data Structure Introduction Time Complexity