問題詳情

【題組】(54) What is the most accurate time complexity of the procedure mystery/, if there are n vertices and m edges?
(A) O(mlog n)
(B)O(m)
(C)O(mn2)
(D)O(n log n)
(E)O(n2 +(m+n)).

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增