Merge sort - first we will merge the unsorted list, and then sort. Quick sort - first we will sort recursively and then partition the arrays.

Merge sort - first we will sort smaller lists, and then merge into bigger list. Quick sort - first we will sort recursively and then partition the arrays.

Merge sort - first we will sort smaller lists, and then merge into bigger sorted list. Quick sort - first we will recursively partition, and then recursively sort.

Merge sort - first we will sort smaller lists, and then merge into bigger list. Quick sort - first we will recursively sort, and then recursively partition bigger arrays.

Answer :(C)

Merge sort - first we will sort smaller lists, and then merge into bigger sorted list. Quick sort - first we will recursively partition, and then recursively sort.

Description :

Merge sort - first we will sort smaller lists, and then merge into bigger sorted list. Quick sort - first we will recursively partition, and then recursively sort.