Q43
Which algorithm uses a binary heap to improve its performance?
A.
Dijkstra's algorithm for shortest paths.
B.
Kruskal's algorithm for minimum spanning tree.
C.
Prim's algorithm for minimum spanning tree.
AnswerD.
Merge sort algorithm.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board