2. The worst case time complexity of constructing a binary heap from an unordered array of n items(A
問題詳情
2. The worst case time complexity of constructing a binary heap from an unordered array of n items (A)O(n) (B)O(n log*n) (C)O(n logn) (D)O(n2) (E)O(n2 log n)