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

 
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
Brossura
ISBN 10: 613076801X ISBN 13: 9786130768010
Casa editrice: Alphascript Publishing, 2010

Sinossi

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.

Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.

Editore
Alphascript Publishing
Data di pubblicazione
2010
Lingua
Inglese
ISBN 10 
613076801X
ISBN 13 
9786130768010
Rilegatura
Copertina flessibile
Numero di pagine
100
Redattore
Miller Frederic P., Vandome Agnes F., McBrewster John
Contatto del produttore
non disponibile
Persona responsabile
non disponibile