Next:
Dynamic programming
Up:
CS Review
Previous:
Priority queue
Contents
Algorithms
This chapter mostly follows the book “Algorithm Design” by Kleinberg and Tardos [
3
]. (Éva Tardos was my professor in CS 4820 at Cornell.)
Subsections
Dynamic programming
Longest increasing subsequence
Longest palindromic substring
