🔰 What is a binary search??

Binary search is a search algorithm used to find the position of a target value within a sorted array.

It works by repeatedly dividing the search interval in half. At each step, it compares the target value with the middle element of the array.

If the target value matches the middle element, the position is returned. If the target value is less than the middle element, the search continues on the lower half of the array. If the target value is greater, the search continues on the upper half.

This process continues until the target value is found or the search interval is empty. Binary search is efficient and has a time complexity of O(log n), where n is the number of elements in the array.