By mswatcher
via stoimen.com
Submitted: Dec 04 2012 / 10:57
A very common problem in computer programming is finding the longest increasing (decreasing) subsequence in a sequence of numbers (usually integers). Actually this is a typical dynamic programming problem.
Add your comment