Which algorithm is based on Divide and Conquer approach?
-
Merge Sort
-
Bubble Sort
-
Selection Sort
-
Quick Sort
A,D
Correct answer
Explanation
Divide and conquer algorithms recursively break problems into smaller subproblems, solve them independently, and combine results. Merge Sort divides array into halves then merges. Quick Sort partitions around a pivot and recursively sorts partitions.