1. Computer Science Engineering (CSE)
  2. Design and Analysis of Algorithms
  3. Kruskal’s algorithm is a              ...

Kruskal’s algorithm is a              

A. divide and conquer algorithm
B. dynamic programming algorithm
C. greedy algorithm
D. approximation algorithm
Answer» C. greedy algorithm
Explanation: 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.