Which of the following algorithms is a classic example of the Divide and Conquer technique?
Options
- A. Binary Search
- B. Bubble Sort
- C. Linear Search
- D. More than one of the above
- E. None of the above
Quiz Practice:
A. Binary Search
Binary Search is a classic Divide and Conquer algorithm. It divides the sorted search space into two halves and determines which half may contain the target. The unnecessary half is discarded, and the process continues recursively or iteratively. Its time complexity is O(log N). Other important Divide and Conquer algorithms include Merge Sort, Quick Sort, and algorithms for finding the maximum or minimum element.