Time complexity of prims algo

#1

what is time complexity of prims algo that sir has taught in video

#2

Time Complexity of the prims algorithm is O(V^2) if the input graph is represented using adjacency matrix . If the input graph is represented using adjacency list, then the time complexity of Prim’s algorithm can be reduced to O(E log V) with the help of binary heap.

#3

here V is no of vertices and E is number of edges .

#4

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.