Question

Which among the following is not based on divide and conquer?

• A. Kruskal algorithm
• B. Quicksort
• C. Binary search
• D. Tower of Hanoi

Hint:

Kruskal’s is greedy, not divide-and-conquer — no recursive subproblem splitting.

Answer 1

The Correct Option is A

Kruskal's algorithm follows the greedy strategy. Divide and conquer splits problems into subproblems — used in quicksort, binary search, and Tower of Hanoi.