9. About algorithm complexity, which of the following claims are true?
(A)merge sort is θ(nlogn).
(B)Euclid's algorithm to find gcd(a,b) is e(log max(a, b)).
(C) bubble sort is θ(nlogn),
(D) Roy-Warshall Algorithm to compute transitive closure is θ(n2) (bit operations).
(E) traveling sales problem is a NP-hard problem.

答案：登入後查看
統計： A(1), B(0), C(1), D(0), E(0) #2993398