How to determine the longest increasing subsequence using dynamic programming?

Posted by Tony on Stack Overflow See other posts from Stack Overflow or by Tony
Published on 2010-04-13T17:26:50Z Indexed on 2010/04/13 17:43 UTC
Read the original article Hit count: 430

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

© Stack Overflow or respective owner

Related posts about dynamic-programming

Related posts about algorithm