Explore the fundamentals of Merge Sort, a stable and highly efficient divide-and-conquer sorting algorithm. This article provides a comprehensive overview, including pseudocode, in-depth algorithmic analysis with Master Theorem derivation, and fully corrected code implementations in Java and C. Learn why Merge Sort consistently delivers $O(n \log n)$ performance across all scenarios, though it requires $O(n)$ auxiliary space.