Question: What is a binary search algorithm, and how does it work?

Answer: Binary search is a divide-and-conquer algorithm used to efficiently locate a target value within a sorted array by repeatedly dividing the search interval in half.

Example:

Searching for a specific element in a sorted array by repeatedly halving the search range.