Q924
Which of the following best represents the time complexity of Karger's algorithm?
A.
O(n)
B.
O(1)
C.
O(n2)
AnswerD.
O(log n)
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board