Login and Register ×
Check your Email for the OTP
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Explanation:
Selection sort has a time complexity of O(N^2), making it less efficient compared to other sorting algorithms for large datasets.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Introduction Time Complexity