Merge sort
In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.
known for
Adaptive sortAkra–Bazzi methodAlgorithmAlgorithmic efficiencyAll nearest smaller valuesAnalysis of algorithmsArray data structureArray mergingAsymptotically optimal algorithmBalanced merge sortBig O notationBinary search algorithmBlock sortBubble sortBucket sortC++ Standard LibraryCache-oblivious algorithmCocktail shaker sortComparison sortComputational complexityDecision tree modelDivide-and-conquer algorithmDynamic programmingExternal sortingFibonacci numberFirst-class functionFisher–Yates shuffleFold (higher-order function)Fork–join modelFunnelsortGeneral-purpose computing on graphics processing unitsGlossary of computer scienceHaskell featuresHeapsortHybrid algorithmIn-place merge sortInput enhancement (computer science)Insertion sortInteger sorting
Link from a Wikipage to another Wikipage
primaryTopic
Merge sort
In computer science, merge sort (also commonly spelled as mergesort) is an efficient, general-purpose, and comparison-based sorting algorithm. Most implementations produce a stable sort, which means that the order of equal elements is the same in the input and output. Merge sort is a divide and conquer algorithm that was invented by John von Neumann in 1945. A detailed description and analysis of bottom-up merge sort appeared in a report by Goldstine and von Neumann as early as 1948.
has abstract
El algoritmo de ordenamiento p ...... Es de complejidad O(n log n).
@es
En informatique, le tri fusion ...... e copie en mémoire temporaire.
@fr
Il merge sort è un algoritmo d ...... dstine e Neumann già nel 1948.
@it
In computer science, merge sor ...... von Neumann as early as 1948.
@en
Mergesort (von englisch merge ...... John von Neumann vorgestellt.
@de
Mergesort is een recursief sor ...... aard gesorteerde) rij over is.
@nl
O merge sort, ou ordenação por ...... eficiente em alguns problemas.
@pt
Sortowanie przez scalanie (ang ...... je się Johnowi von Neumannowi.
@pl
Urut gabung atau sering juga d ...... n von Neumann pada tahun 1945.
@in
Řazení slučováním, známé také ...... 45 matematik John von Neumann.
@cs
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,346,522
Link from a Wikipage to another Wikipage
best-time
typical,
natural variant
@en
caption
An example of merge sort. Firs ...... lements are sorted and merged.
@en
class
date
2015-03-06
optimal
Yes
@en
space
total with auxiliary, auxiliary with linked lists
@en
title
Animated Sorting Algorithms: Merge Sort
@en
url
wikiPageUsesTemplate
subject
hypernym
type
comment
El algoritmo de ordenamiento p ...... Es de complejidad O(n log n).
@es
En informatique, le tri fusion ...... fusionnées en temps linéaire.
@fr
Il merge sort è un algoritmo d ...... dstine e Neumann già nel 1948.
@it
In computer science, merge sor ...... von Neumann as early as 1948.
@en
Mergesort (von englisch merge ...... John von Neumann vorgestellt.
@de
Mergesort is een recursief sor ...... aard gesorteerde) rij over is.
@nl
O merge sort, ou ordenação por ...... eficiente em alguns problemas.
@pt
Sortowanie przez scalanie (ang ...... je się Johnowi von Neumannowi.
@pl
Urut gabung atau sering juga d ...... n von Neumann pada tahun 1945.
@in
Řazení slučováním, známé také ...... 45 matematik John von Neumann.
@cs
label
Kunfanda ordigo
@eo
Merge sort
@en
Merge sort
@it
Merge sort
@pt
Merge sort
@sv
Mergesort
@de
Mergesort
@nl
Ordenamiento por mezcla
@es
Sortowanie przez scalanie
@pl
Tri fusion
@fr