Source: wikibot/merge-sort
= Merge sort
{wiki=Merge_sort}
Merge sort is a classic, efficient, and stable sorting algorithm that follows the divide-and-conquer strategy. It was invented by John von Neumann in 1945. Here's a breakdown of how it works: \#\#\# Key Concepts: 1. **Divide:** - The input array is divided into two halves. This process continues recursively until each subarray has one or zero elements, at which point they can be considered sorted.