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 - Softcover

 
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
Softcover
ISBN 10: 613076801X ISBN 13: 9786130768010
Verlag: OmniScriptum, 2010

Inhaltsangabe

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.

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.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.

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

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