(1) quick sort 及 insertion sort 的 worst case 之時間複雜度均為 O(n2 )。(A)O(B)X

(60) Let G=(V,E) be a bipartite graph, where V= L ∪ R. Which statement is wrong about finding a maximum bipartite matching? (A) It can be solved by constructing a corresponding flow network and finding the maximum flow. (B) The corresponding flow network can be obtained by adding two vertices s, t and edges from s to vertices in L, and edges from vertices in R to t. (C) The capacity of each edge in the corresponding flow network is set to 1. (D) The maximum flow of the corresponding flow network is always integral and the flow value of each edge is integral as well. (E) The cardinality of a maximum matching of G is equal to the maximum flow of the corresponding flow network.

(1) quick sort 及 insertion sort 的 worst case 之時間複雜度均為 O(n²)。
(A)O
(B)X

相關試題

相關試卷