BIT BY BYTE
Question 1 of 2
2 marks
Explain why binary search is more efficient than linear search.
Binary search halves the data each step, so it needs far fewer comparisons (log₂n vs n)
Binary search uses less memory than linear search
Binary search works on any list, making it more versatile
Binary search checks two items at once, making it twice as fast
Check Answer