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

Roughgarden, Tim

ISBN 10: 0999282948 / ISBN 13: 9780999282946

Verlag: Soundlikeyourself Publishing, LLC, 2019

Beschreibung

Most items will be dispatched the same or the next working day. An apparently unread copy in perfect condition. Dust cover is intact with no nicks or tears. Spine has no signs of creasing. Pages are clean and not marred by notes or folds of any kind.

Bestandsnummer des Verkäufers wbs5140091657

Bibliografische Details

• Titel: Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
• Verlag: Soundlikeyourself Publishing, LLC
• Erscheinungsjahr: 2019
• Sprache: Englisch
• ISBN-10: 0999282948
• ISBN-13: 9780999282946
• Einband: Softcover
• Zustand: Like New
• Gewicht: 340 Gramm

Über diesen Titel

Inhaltsangabe

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

Críticas

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.