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

Prim’s algorithm is a              

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