Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
Product Description
Algorithms Illuminated (Part 3): Greedy Algorithms and Dynamic Programming
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).
Technical Specifications
You might also like
Algorithms Illuminated (Part 2): Graph Algorithms and Data Structures (Volume 2)
—
Algorithms Illuminated: Part 1: The Basics
—
Algorithms
—
Artificial Intelligence Engines: A Tutorial Introduction to the Mathematics of Deep Learning
—
Daily Coding Problem: Get exceptionally good at coding interviews by solving one problem every day
—
Hands-On Unsupervised Learning Using Python: How to Build Applied Machine Learning Solutions from Unlabeled Data
—
Twenty Lectures on Algorithmic Game Theory
—
Algorithms for Optimization (The MIT Press)
—
Machine Learning: An Applied Mathematics Introduction
—
Data Science from Scratch: First Principles with Python
—