題組內容

9. Select all statements that are correct about sorting algorithms. (10%)

(c) If worst-case time complexity is important, heap sort and merge sort are better choices than quick sort.