Algorithms Illuminated Part 3: Greedy Algorithms and Dynamic Programming

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

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

Author: Tim Roughgarden

Publisher finelybook 出版社:‏ ‎ Soundlikeyourself Publishing, LLC

Edition 版本:‏ N/A

Publication Date 出版日期:‏ 2019-05-01

Language 语言: English

Print Length 页数: 232 pages

ISBN-10: 0999282948

ISBN-13: 9780999282946

Book Description


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

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.

Amazon Page

下载地址

PDF | 5 MB | 2020-02-12
下载地址 Download解决验证以访问链接!
打赏
未经允许不得转载:finelybook » Algorithms Illuminated Part 3: Greedy Algorithms and Dynamic Programming

评论 抢沙发

觉得文章有用就打赏一下

您的打赏,我们将继续给力更多优质内容

支付宝扫一扫

微信扫一扫