Longest increasing subsequence problem: Difference between revisions

Revision as of 18:35, 11 November 2005

Revision as of 20:48, 20 December 2005

Line 42:

Since <math>A</math> is always ordered in increasing order, and the operation does not change this ordering, we can do a binary search for every single <math>a_1, a_2, \ldots, a_n</math>.

== External Links ==

[http://www.algorithmist.com/index.php/Longest_Increasing_Subsequence Algorithmist's Longest

Increasing Subsequence] - Where this article was taken.

[[Category:Algorithms on strings]]