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

Tim Roughgarden

ISBN 10: 0999282948 / ISBN 13: 9780999282946

Verlag: Soundlikeyourself Publishing, LLC, 2019

Beschreibung

nach der Bestellung gedruckt Neuware - Printed after ordering - Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and machine learning. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical interviews. Algorithms Illuminated is an accessible introduction to the subject for anyone with at least a little programming experience. The exposition emphasizes the big picture and conceptual understanding over low-level implementation and mathematical details---like a transcript of what an expert algorithms tutor would say over a series of one-on-one lessons. Part 3 covers greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, shortest paths, optimal search trees). Bestandsnummer des Verkäufers 9780999282946

Bibliografische Details

Titel: Algorithms Illuminated (Part 3) : Greedy ...

Verlag: Soundlikeyourself Publishing, LLC

Erscheinungsdatum: 2019

Einband: Taschenbuch

Zustand: Neu

Über diesen Titel

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.