Algorithms Illuminated (Part 3)

书名：Algorithms Illuminated (Part 3)GreedyAlgorithmsandDynamicProgramming
作者：TimRoughgarden
译者：
ISBN：9780999282946
出版社：SoundlikeyourselfPublishing,LLC
出版时间：2019-5-1
格式：epub/mobi/azw3/pdf
页数：229
豆瓣评分：

书籍简介：

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

作者简介：

Tim Roughgarden is a Professor of Computer Science and (by courtesy) Management Science and Engineering at Stanford University, where he has taught and researched algorithms since 2004. This book is the first of a four-part series based on his online algorithms courses that have been running regularly since 2012.

书友短评：

@ myym🐟 路漫漫其修远矣 世界上的两种问题：1 solved well problems 2 using approximational tools to solve problems @ myym🐟 路漫漫其修远矣 世界上的两种问题：1 solved well problems 2 using approximational tools to solve problems

　　Algorithms Illuminated(共4册)，这套丛书还有《Algorithms Illuminated》《Algorithms Illuminated (Part 2)》《Algorithms Illuminated (Part 4): Algorithms for NP-Hard Problems》。

添加微信公众号:好书天下获取