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

Tim Roughgarden

ISBN 10: 0999282948 / ISBN 13: 9780999282946

Published by Soundlikeyourself Publishing, LLC, 2019

About this Item

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). Seller Inventory # 9780999282946

Bibliographic Details

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

Publisher: Soundlikeyourself Publishing, LLC

Publication Date: 2019

Binding: Taschenbuch

Condition: Neu

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

More