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).

答案:登入後查看
統計: 尚無統計資料

詳解 (共 1 筆)

#6840833
1. 題目解析 這道題目要求判斷四個關...
(共 1147 字,隱藏中)
前往觀看
0
0