Merge sort: Comparison sort, Sorting algorithm, Divide and conquer algorithm, John von Neumann, Recursion, Merge algorithm, Array data structure, ... Worst- case performance, Average performance - Softcover

 
9786130767976: Merge sort: Comparison sort, Sorting algorithm, Divide and conquer algorithm, John von Neumann, Recursion, Merge algorithm, Array data structure, ... Worst- case performance, Average performance
Softcover
ISBN 10: 6130767978 ISBN 13: 9786130767976
Verlag: OmniScriptum, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online.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.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Reseña del editor

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online.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.

„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
OmniScriptum
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6130767978
ISBN 13 
9786130767976
Einband
Tapa blanda
Anzahl der Seiten
128
Herausgeber
Miller Frederic P., Vandome Agnes F., McBrewster John
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar