25. Which of the following statements is NOT true?
(A) If a problem is NP-complete, then there exists no polynomial-time algorithm
(B) If a problem is NP-complete, then it is also NP-hard.
(C) The halting problem is not solvable by a computer.
(D) For random access, an array is more efficient than a linked list.
(E) A heap is always a complete tree.
阿摩線上測驗
登入