Heapsort: Comparison sort, Sorting algorithm, Selection sort, In- place algorithm, Quicksort, Stable sort, Heap (data structure), Smoothsort, Adaptive sort, Cartesian tree, Merge sort, Data cache - Tapa blanda

 
9786130768010: Heapsort: Comparison sort, Sorting algorithm, Selection sort, In- place algorithm, Quicksort, Stable sort, Heap (data structure), Smoothsort, Adaptive sort, Cartesian tree, Merge sort, Data cache
Tapa blanda
ISBN 10: 613076801X ISBN 13: 9786130768010
Editorial: OmniScriptum, 2010

Sinopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online.Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a good implementation of quicksort, it has the advantage of a worst-case Θ(n log n) runtime. Heapsort is an in-place algorithm, but is not a stable sort.

"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.Heapsort is a comparison-based sorting algorithm, and is part of the selection sort family. Although somewhat slower in practice on most machines than a good implementation of quicksort, it has the advantage of a worst-case Θ(n log n) runtime. Heapsort is an in-place algorithm, but is not a stable sort.

"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 
613076801X
ISBN 13 
9786130768010
Encuadernación
Tapa blanda
Número de páginas
100
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John
Contacto del fabricante
no disponible
Persona responsable
no disponible