試題詳解

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