Discrete Mathematics Week7 A sample Question Merge Sort Algorithm

This is from L13 of week7.

Merge Sort is a popular and efficient comparison-based sorting algorithm known for its stable and consistent performance. It follows the divide-and-conquer approach to sort a list or array of elements. The key idea behind Merge Sort is to repeatedly divide the list into smaller sublists, sort these sublists independently, and then merge them back together to create a sorted list.