Items related to Algorithms Illuminated (Part 3): Greedy Algorithms...

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

Book 3 of 4: Algorithms Illuminated

Roughgarden, Tim

  • 4.48 out of 5 stars
    67 ratings by Goodreads
 
9780999282946: Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
Softcover
ISBN 10: 0999282948 ISBN 13: 9780999282946
Publisher: Soundlikeyourself Publishing, LLC, 2019

Synopsis

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).

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

Review

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.

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

Publisher
Soundlikeyourself Publishing, LLC
Publication date
2019
Language
English
ISBN 10 
0999282948
ISBN 13 
9780999282946
Binding
Paperback
Number of pages
232
Rating
  • 4.48 out of 5 stars
    67 ratings by Goodreads