Question

Which of the following is an example of divide and conquer strategy?

• A. Hashing
• B. Quick sort
• C. Dynamic programming
• D. Primality testing

Hint:

In divide and conquer algorithms, the problem is divided into smaller parts, solved independently, and then recombined.

Answer 1

The Correct Option is B

The divide and conquer strategy involves dividing a problem into smaller subproblems, solving each subproblem, and combining the results. Quick sort is a classic example of the divide and conquer approach as it divides the array into smaller parts and recursively sorts them.
Thus, the correct answer is \( \text{Quick sort} \).