Page 1 of 1
Longest Increasing Subsequence
Posted: Fri Jun 13, 2003 5:08 pm
by technogeek
In the problem History Grading I need to use this algorithm but don't know how. Can someone plese show me how to find LIS from an array of integers (named 'answer') in C code ?
Posted: Fri Jun 13, 2003 11:29 pm
by bugzpodder
are you talking about the longest common subsequence?
NO...Not LCS
Posted: Sun Jun 15, 2003 3:02 pm
by technogeek
Nope. Not Longest Common Subsequence. Check out this link, it has some description :
Definition :
http://mathworld.wolfram.com/LongestInc ... uence.html
Analysis :
http://www2.toki.or.id/book/AlgDesignMa ... NODE47.HTM
I am still searching for good info on how to solve it.