Longest increasing subsequence - Rosetta Code A solution based on patience sorting, except that it ...

Please Visit: http://ift.tt/1ajReyV

Longest increasing subsequence - Rosetta Code



A solution based on patience sorting, except that it is not necessary to keep the whole pile, only the top (in solitaire, bottom) of the pile, along with pointers from each "card" to the top of its "previous" pile.

http://ift.tt/1ka8Q6b

http://ift.tt/1rYJxvw

Longest increasing subsequence - Rosetta Code

from Public RSS-Feed of Jeffery yuan. Created with the PIXELMECHANICS 'GPlusRSS-Webtool' at http://gplusrss.com http://ift.tt/1rYJxvB

via LifeLong Community