Explain 'Binary Search' on a sorted array.

Explain 'Binary Search' on a sorted array.

Approach: Describe repeatedly halving the search space.

Compare the target with the middle element. If smaller, repeat in the left half; if larger, repeat in the right half. This continues until found or the range is empty.

Follow-up: What is the time complexity?

Key concepts: halving, logarithmic, sorted.