Login and Register ×
Check your Email for the OTP
Data Structure Introduction Time Complexity
⚠ Report ✓ Question Verified Copy Link
Explanation:
Bubble sort has a time complexity of O(N^2), making it inefficient for large datasets. It involves repeated swapping of adjacent elements until the entire list is sorted.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Introduction Time Complexity