Concepts
Merge Sort
Algorithm
Citation Formats
General Reference
APA Style
BibTeX
A divide-and-conquer sorting algorithm invented by John von Neumann in 1945, one of the earliest algorithms described specifically for an electronic computer, with a fuller analysis appearing in a 1948 report by Goldstine and von Neumann.
Facts
Core PrincipleSplit the input in half, recursively sort each half, then merge the two sorted halves back together in linear time, giving guaranteed O(n log n) performance regardless of the input's starting order. 1 Cross-Tradition Connections
Associated With
In Field
Invented By
Sources
Reader Challenges (0 open reader challenges)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.
View At A Past Year
The atlas records no dated fact of its own for this entry, so there is no other year to choose.