Mergesort Algorithm

From GM-RKB
Revision as of 04:09, 29 April 2012 by Gmelli (talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

A Mergesort Algorithm is a Sorting Algorithm that uses a Divide and Conquer Strategy.

  • (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.
Retrieved from "http://www.gabormelli.com/RKB/index.php?title=Mergesort_Algorithm&oldid=17317"