Merge sortMerge sort
Rare
Rarity: Rare
A topic known well beyond its field, found in many languages.
Rarity follows how well known the article is: its views on the French and English Wikipedia over a year, and the number of languages it exists in.
At a glance
- Class
- Notion
- Domain
- Science and technology
- In collections
- Nobody has pulled it yet.
What Wikipedia says
Merge sort (also commonly spelled as mergesort or merge-sort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations of merge sort are stable, which means that the relative order of equal elements is the same between the input and output.
Excerpt from the Wikipedia article “Merge sort”, under the CC BY-SA 4.0 license. Read the article on Wikipedia
Image: Swfung8, CC BY-SA 3.0, via Wikimedia Commons.
Open free boosters and add Merge sort to your collection.
Play for free




