Mergesort Algorithm
(Redirected from merge sort)
Jump to navigation
Jump to search
A Mergesort Algorithm is a Sorting Algorithm that uses a Divide and Conquer Strategy.
- AKA: Merge Sort.
- …
- Counter-Example(s):
- See: Timsort Algorithm, Comparison Sort, Stable Sorting Algorithm, Divide and Conquer Algorithm.
References
2016
- (Wikipedia, 2016) ⇒ https://en.wikipedia.org/wiki/Merge_sort Retrieved:2016-6-1.
- In computer science, merge sort (also commonly spelled mergesort) is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the implementation preserves the input order of equal elements in the sorted output. Mergesort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up mergesort appeared in a report by Goldstine and Neumann as early as 1948.
2009
- (Wikipedia, 2009) ⇒ http://en.wikipedia.org/wiki/Divide_and_conquer_algorithm
- In computer science, merge sort or merge_sort is an O(n log n) comparison-based sorting algorithm. In most implementations it is stable, meaning that it preserves the input order of equal elements in the sorted output. It is an example of the divide and conquer algorithmic paradigm. It was invented by John von Neumann in 1945.