Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01278708n
Noun Concept
Categories: Stable sorts, Divide-and-conquer algorithms, Comparison sorts
EN
merge sort  Array merging  Balanced merge sort  in-place merge sort  mergesort
EN
In computer science, merge sort is an efficient, general-purpose, and comparison-based sorting algorithm. Wikipedia
Definitions
Relations
Sources
EN
In computer science, merge sort is an efficient, general-purpose, and comparison-based sorting algorithm. Wikipedia
Worst-case optimal stable divide and conquer comparison sorting algorithm Wikidata
IS A
comparison sort
NL
Stabiliteit
sorting algorithm
DERIVATIVE WORK
Timsort
DISCOVERER OR INVENTOR
von Neumann
USES
merge algorithm
array
Wikipedia
EN
merge sort
Wikidata
EN
merge sort
Wikipedia Redirections
EN
Array merging, Balanced merge sort, in-place merge sort, Merge Sort, mergesort, natural merge sort, parallel merge sort, tiled merge sort
Wikidata Alias
EN
mergesort

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License