Login and Register ×
Check your Email for the OTP
Data Structure Searching Algorithms
⚠ Report ✓ Question Verified Copy Link
Explanation:
Answer: Binary search
Explanation: Binary search has a time complexity of O(log n), which is better than the time complexity of the other searching algorithms.
Related Topic:
Share Above MCQ
Learn More MCQ Questions from Data Structure Searching Algorithms