16. Which of the following are true?
(A) The worst-case running time for quicksort is O(nlogn).
(B) No additional memory for array is required for quicksort.
(C) The best-case running time for bubble-sort is O(nlogn).
(D) The best-case running time for insertion-sort is O(n).
答案:登入後查看
統計: 尚無統計資料
統計: 尚無統計資料