An algorithm repeatedly divides a problem into smaller sub-problems, solves them independently, and combines the results to obtain the final solution. Determine the algorithm that follows this strategy.
Show Hint
Other famous examples of Divide and Conquer include Merge Sort and Quick Sort. Remember that for Binary Search to work, the input data MUST be sorted beforehand.