Vidyalelo
Data Structure · Q150

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 150

Q150

Kruskal's algorithm is a . . . . . . . .

A.
divide and conquer algorithm
B.
dynamic programming algorithm
C.
greedy algorithm
Answer
D.
approximation algorithm

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board