A

Admin • 828.03K Points
Coach

Q. Kruskal’s algorithm is a

  • (A) divide and conquer algorithm
  • (B) dynamic programming algorithm
  • (C) greedy algorithm
  • (D) approximation algorithm
Explanation by: Admin
kruskal’s algorithm uses a greedy algorithm approach to find the mst of the connected weighted graph. in the greedy method, we attempt to find an optimal solution in stages.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.