Merge Sort
Merge Sort is an efficient, general-purpose, comparison-based sorting algorithm. It follows the divide and conquer paradigm, which involves breaking a problem into smaller subproblems, solving them independently, and then combining their solutions to solve the original problem.