問題詳情
24. For sorting n integers, which of the following statements is true?
(A) Both quick sort and merge sort have O(nlogn) worst-case time complexity.
(B) Both quick sort and merge sort are stable sorting algorithms.
(C) Both quick sort and merge sort do not need extra space.
(D) Heap sort achieves O(nlogn) average-case time complexity.
(E) Heap sort needs extra space during sorting.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增
用户評論
【黎慶噎】評論
答案為(D)(A):quick sort worst-case time O(n^2)(B)quick sort is not stable sorting(C)both need extra space(E)heap don't need extra space