Binary Search efficiently finds a target value in a sorted array by repeatedly dividing the search space in half.
Each comparison eliminates half of the remaining elements, resulting in logarithmic time complexity.
💡 Tip: The array must be sorted for binary search to work correctly. Watch how the search range shrinks by half each step!