BIT BY BYTE
Back
Question 1 of 8
3 marks
Explain why binary search is more efficient than linear search for a large sorted list.
Binary search checks two items at once, making it twice as fast
Binary search eliminates half the remaining data with each comparison (log₂n steps vs up to n steps for linear search)
Binary search works on any list, making it more versatile than linear search
Binary search uses less memory than linear search
Check Answer