The worst case is the worst case time complexity of Prim’s algorithm if the adjacency matrix is used.

Worst case is the worst case time complexity of Prim’s algorithm if adjacency matrix is used?

Right Answer is:
O(V²)

SOLUTION

The use of an adjacency matrix provides the simple implementation of Prim’s algorithm.

In Prim’s algorithm, we need to search for the edge with a minimum for that vertex. So, worst case time complexity will be O(V²), where V is the number of vertices.

The worst case is the worst case time complexity of Prim’s algorithm if the adjacency matrix is used.

O(log V)

O(V²)

O(E²)

O(V log E)

Right Answer is:
O(V²)

SOLUTION

The worst case is the worst case time complexity of Prim’s algorithm if the adjacency matrix is used.

O(log V)

O(V2)

O(E2)

O(V log E)

Right Answer is: O(V2)

SOLUTION

O(V²)

O(E²)

Right Answer is:
O(V²)