How to determine the longest increasing subsequence using dynamic programming?
- by Tony
Let's say I have a set of integers. I want to find the longest increasing subsequence of that set using dynamic programming. This is simply out of practice, reviewing my old notes from my algorithms course, and I don't seem to understand how this works.
Thanks