In binary search, if the middle element is less than the key, search t…

Question

In binary search, if the middle element is less than the key, search the:

Accepted Answer

D. Second half

1. Everything before the middle is smaller still.
2. The key can only lie after the middle.
3. If the middle element is less than the key, the key must be in the second half.
4. So the answer is the second half.
_Source: syllabus Computer Science, Ch 5 'Sorting' and Ch 6 'Searching'_

Answer

Steady half

Answer

Single half

Answer

Shorter half

In binary search, if the middle element is less than the key, search the:

Keep practising Sorting and Searching