Q123
Worst case is the worst case time complexity of Prim's algorithm if adjacency matrix is used?
A.
O(log V)
B.
O(V2)
AnswerC.
O(E2)
D.
O(V log E)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board