Intro

The algorithms to find the longest increasing subsequence in a sequence are discussed in various places (including Wikipedia), but in my opinion their exposition is not intuitive.

Wikipedia:

M[*j*] — stores the index *k* of the smallest value X[*k*] such that there is an increasing subsequence of length *j* ending at X[*k*] on the range *k* ≤ *i*.

Precise and succinct but not easy to parse and grasp.

[Read More...]