Question

Which algorithm strategy is followed by Kruskal's algorithm?

• A. Divide and conquer
• B. Dynamic programming
• C. Greedy
• D. Branch and bound

Hint:

Greedy algorithms build solutions step-by-step using the locally optimal choice — as Kruskal’s does.

Answer 1

The Correct Option is C

Kruskal's algorithm builds a minimum spanning tree by selecting the smallest edge that does not form a cycle. It uses the greedy strategy.