(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(mn²)
(D)O(n log n)
(E)O(n² +(m+n)).

1. 題目解析題目要求我們分析一段 ...