Merge sort is a stable, comparison-based sorting algorithm that uses the divide-and-conquer paradigm to sort elements in $O(n \log n)$ time. Algorithm Overview Divide and Conquer Strategy Divide: Split array into two halves Conquer: Recursively sort each half Combine: Merge the two sorted halves Mathematical …