Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming - Brossura

Libro 3 di 4: Algorithms Illuminated

Roughgarden, Tim

 
9780999282946: Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
Brossura
ISBN 10: 0999282948 ISBN 13: 9780999282946
Casa editrice: Soundlikeyourself Publishing, LLC, 2019

Sinossi

Accessible, no-nonsense, and programming language-agnostic introduction to algorithms. Includes hints or solutions to all quizzes and problems, and a series of YouTube videos by the author accompanies the book. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees).

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

Recensione

From Amazon.com (by Vladimir):

Yet another golden nugget from professor Roughgarden. Outstanding self-learning material for those who learn algorithms for the first time or for those who revisit the subject for rock-solid fundamental knowledge. Clear explanations for most popular greedy and dynamic programming algorithms. Throughout my experience interviewing CS graduates when working in the product development industry and back in times when I was a university lecturer, I found that for most students dynamic programming is one of the weakest areas among algorithm design paradigms. This book has outstanding, clear, easy to understand coverage for this topic.

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

Editore
Soundlikeyourself Publishing, LLC
Data di pubblicazione
2019
Lingua
Inglese
ISBN 10 
0999282948
ISBN 13 
9780999282946
Rilegatura
Copertina flessibile
Numero di pagine
232
Contatto del produttore
non disponibile
Persona responsabile
non disponibile