+Merge Sort is an efficient, stable [sorting](/wiki/sorting) algorithm that follows the [divide and conquer](/wiki/divide_and_conquer) paradigm. It works by recursively breaking down a list into sub-lists until each contains a single element, then merging those sub-lists back together in a sorted manner. This process ensures the entire list is ordered.
+## See also
+- [Quicksort](/wiki/quicksort)
+- [Recursion](/wiki/recursion)
+- [Time Complexity](/wiki/time_complexity)
... 1 more lines