What is the running time of Karger’s algorithm to find the minimum c

1.	What is the running time of Karger’s algorithm to find the minimum cut in a graph?
A.	O(E)
B.	O(\|V\|2)
C.	O(V)
D.	O(\|E\|)
Answer» C.

Discussion