問題詳情
7. For the sorting methods with the same time complexity in best, average and worst cases in the following, whichone has both the smallest time and space complexity in worst case?
(A) Selection sort
(B) Quick sort
(C) Merge sort
(D) Insertion sort
(E) Heap sort
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增
用户評論
【黎慶噎】評論
(E)Selection sortQui☆☆ ...