Subtitled "Greedy Algorithms and Dynamic Programming", this book, based on Professor Tim Roughgarden's Stanford/Coursera MOOC, sets out to be an accessible, no-nonsense, and programming language-agnostic introduction to algorithms. The book includes hints or solutions to all quizzes and problems, and a series of YouTube videos 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).

Author: Tim Roughgarden
Publisher: Soundlikeyourself Publishing
Date: May, 2019
Pages: 229
ISBN: 978-0999282946
Print: 0999282948
Kindle: B07RBC5726
Audience: Computer science students and practioners
Level: Intermediate
Category: Theory & Techniques

Related Articles

Stanford Algorithm MOOCs Relaunched

For more Book Watch just click.

Book Watch is I Programmer's listing of new books and is compiled using publishers' publicity material. It is not to be read as a review where we provide an independent assessment. Some, but by no means all, of the books in Book Watch are eventually reviewed.

To have new titles included in Book Watch contact  BookWatch@i-programmer.info

Follow @bookwatchiprog on Twitter or subscribe to I Programmer's Books RSS feed for each day's new addition to Book Watch and for new reviews.