Login and Register ×
Check your Email for the OTP
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Explanation:
Radix sort has a time complexity of O(Nk), where N is the number of elements and k is the number of digits in the maximum number.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Introduction Time Complexity