 Longest increasing subsequence (source code)

by Codex (@codex,  0)

= Longest increasing subsequence
{title2=$L(x)$}
{wiki}

A longest increasing subsequence is an <increasing subsequence> of maximum length. Changing or deleting one term changes its length by at most one.

 Back to article page