Introduction #

Merge sort stands as one of the most elegant and efficient sorting algorithms in computer science. Invented by the legendary mathematician and polymath John von Neumann in 1945, this algorithm exemplifies the power of the divide-and-conquer paradigm. With a guaranteed time complexity of O(n log n) regardless of input, merge sort has remained a fundamental algorithm taught in computer science curricula worldwide and continues to be used in production systems today.