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

Roughgarden, Tim

ISBN 10: 0999282948 / ISBN 13: 9780999282946

Published by Soundlikeyourself Publishing, LL, 2019

About this Item

Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority!

Seller Inventory # S_423258385

Bibliographic Details

• Title: Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
• Publisher: Soundlikeyourself Publishing, LL
• Publication Date: 2019
• Language: English
• ISBN 10: 0999282948
• ISBN 13: 9780999282946
• Binding: paperback
• Condition: Good

About this title

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.