Multiple choice

Which of the following algorithms solves the minimum weight spanning tree problem?

  1. Greedy

  2. Depth-first Search

  3. Dynamic Programming

  4. Divide & Conquer
Reveal answer Fill a bubble to check yourself
A Correct answer
Explanation

Algorithms like Kruskal's and Prim's find the minimum weight spanning tree by making locally optimal choices at each step, which is the defining characteristic of greedy algorithms.

Keep practicing — related questions