Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
Roughgarden, Tim
ISBN 10: 0999282948 ISBN 13: 9780999282946
Published by Soundlikeyourself Publishing, LLC, 2019
Used
Soft cover
From
Zoom Books Company, Lynden, WA, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since December 19, 2022
This specific item is no longer available.
About this Item
Description:
Book is in very good condition and may include minimal underlining highlighting. The book can also include "From the library of" labels. May not contain miscellaneous items toys, dvds, etc. . We offer 100% money back guarantee and 24 7 customer service. Seller Inventory # ZBV.0999282948.VG
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).
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.
Bibliographic Details
Title: Algorithms Illuminated (Part 3): Greedy ...
Publisher: Soundlikeyourself Publishing, LLC
Publication Date: 2019
Binding: Soft cover
Condition: very_good