Which of the following best describes the divide-and-conquer approach used in binary search?
-
Solving a problem by breaking it down into smaller subproblems
-
Using a single loop to iterate through elements
-
Recursively calling the same function without any condition
-
Sorting the array before searching
