Which search algorithm requires data to be sorted beforehand and repeatedly divides the search interval in half?

Explanation

Binary Search requires a pre-sorted array. It compares the target value to the middle element, cutting the search domain in half with each iteration, achieving an efficient time complexity of O(log n).