Sign up
Forgot password?
FAQ: Login

Roughgarden T. Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming

  • pdf file
  • size 10,22 MB
  • added by
  • info modified
Roughgarden T. Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
New York: Soundlikeyourself Publishing, LLC, 2019. — 229 p.
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).
  • Sign up or login using form at top of the page to download this file.
  • Sign up

See also

Details

Roughgarden T. Algorithms Illuminated. Part 1. The Basics

  • pdf
New York: Soundlikeyourself Publishing, 2017. — 216 p. — ISBN: 978-0-9992829-1-5. Algorithms are the heart and soul of computer science. Their applications range from network routing and computational genomics to public-key cryptography and database system implementation. Studying algorithms can make you a better programmer, a clearer thinker, and a master of technical...
  • 5,52 MB
  • added
  • info modified
Details

Roughgarden T. Algorithms Illuminated. Part 2: Graph Algorithms and Data Structures

  • pdf
Soundlikeyourself Publishing, LLC, 2018. — 221 p. — ISBN: 0999282921, 9780999282922. 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....
  • 7,93 MB
  • added
  • info modified
Up