阿摩線上測驗
7. For the sorting methods with the same time complexity in best, average and worst cases in the following, which
one 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
答案：登入後查看
統計： A(0), B(1), C(1), D(1), E(0) #2793464
統計： A(0), B(1), C(1), D(1), E(0) #2793464