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

 
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
Brossura
ISBN 10: 6130767978 ISBN 13: 9786130767976
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.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.

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 
6130767978
ISBN 13 
9786130767976
Rilegatura
Copertina flessibile
Numero di pagine
128
Redattore
Miller Frederic P., Vandome Agnes F., McBrewster John
Contatto del produttore
non disponibile
Persona responsabile
non disponibile