fa26-cs577 cs577
Lecture 04: Dynamic Programming Lecture 04: Dynamic Programming
Content locked
The catalog is public. Reading this content requires approved access.
Sign in to readLecture 04: Dynamic Programming
DP unit map
What dynamic programming changes
The DP recipe
Fibonacci: repeated recursion versus stored answers
Top-down memoization
Bottom-up tabulation
Longest increasing subsequence (LIS)
Longest palindromic subsequence (LPS)
Smart robber: selecting nonadjacent entries
Comparing the states
Source acknowledgments