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

 
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
Tapa blanda
ISBN 10: 6130767978 ISBN 13: 9786130767976
Editorial: OmniScriptum, 2010

Sinopsis

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.

"Sinopsis" puede pertenecer a otra edición de este libro.

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.

"Sobre este título" puede pertenecer a otra edición de este libro.

Editorial
OmniScriptum
Año de publicación
2010
Idioma
Inglés
ISBN 10 
6130767978
ISBN 13 
9786130767976
Encuadernación
Tapa blanda
Número de páginas
128
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John
Contacto del fabricante
no disponible
Persona responsable
no disponible