Correct Answer (Detailed Explanation is Below)
A.
Binary Search
Detailed Explanation
Binary Search is a classic example of the Divide and Conquer technique. It works on a sorted collection by comparing the target with the middle element and eliminating approximately half of the remaining search space after each comparison. This produces a time complexity of
O(log n). Other classic examples of Divide and Conquer include Merge Sort, Quick Sort, and the traditional recursive approach to finding certain computational results by splitting a problem into smaller independent subproblems.
