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
Publisher: OmniScriptum, 2010

Synopsis

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.

"synopsis" may belong to another edition of this title.

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.

"About this title" may belong to another edition of this title.

Publisher
OmniScriptum
Publication date
2010
Language
English
ISBN 10 
613076801X
ISBN 13 
9786130768010
Binding
Tapa blanda
Number of pages
100
Editor
Miller Frederic P., Vandome Agnes F., McBrewster John