1. In a quick sort, the sorting work is done in partitioning the list. 2. On average, the number of key comparisons in a quick sort is O(nlog2n). In the worst case, the number of key comparisons in a...

1. In a quick sort, the sorting work is done in partitioning the list.

2. On average, the number of key comparisons in a quick sort is O(nlog2n). In the worst case, the number of key comparisons in a quick sort is O(n²).

3. The merge sort algorithm partitions the list by dividing it in the middle.

4. In a merge sort, the sorting work is done in merging the list.

5. The number of key comparisons in a merge sort is O(nlog2n).