个人学习好书推荐与知识分享
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.
《Algorithms Illuminated (Part 3)》Tim Roughgarden 【benniaobook.org】.pdf
密码:2024 感谢您喜欢博主推荐此书,请支持购买正版。
发表回复
要发表评论,您必须先登录。