It is possible to design Prim's algorithm so that it is of the order O(n²).

Name: It is possible to design Prim's algorithm so that it is of the order O(n²).
Brand: Quizplus
Rating: 4.9 (30 reviews)

Question

Quizplus · Accepted Answer

Prim's algorithm can be implemented using a binary heap data structure to improve its efficiency. With this implementation, the time complexity of Prim's algorithm can be reduced to O(n²), where n is the number of vertices in the graph. However, without such optimization, the time complexity of Prim's algorithm is O(n³).

It Is Possible to Design Prim's Algorithm So That It