Master Theorem: Analysis of algorithms, Recurrence relation, Divide and conquer algorithm, Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson - Softcover

 
9786132876775: Master Theorem: Analysis of algorithms, Recurrence relation, Divide and conquer algorithm, Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson
Softcover
ISBN 10: 6132876774 ISBN 13: 9786132876775
Verlag: Alphascript Publishing, 2010

Inhaltsangabe

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In the analysis of algorithms, the master theorem provides a cookbook solution in asymptotic terms (using Big O notation) for recurrence relations of types that occur in the analysis of many divide and conquer algorithms. It was popularized by the canonical algorithms textbook Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein, which introduces and proves it in sections 4.3 and 4.4, respectively. Nevertheless, not all recurrence relations can be solved with the use of the master theorem; its generalizations include the Akra–Bazzi method.

Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.

Verlag
Alphascript Publishing
Erscheinungsdatum
2010
Sprache
Englisch
ISBN 10 
6132876774
ISBN 13 
9786132876775
Einband
Broché
Anzahl der Seiten
64
Herausgeber
Miller Frederic P., Vandome Agnes F., McBrewster John
Kontakt zum Hersteller
Nicht verfügbar
Verantwortliche Person
Nicht verfügbar