Perl-Sensitive Sunglasses | |
PerlMonks |
Re^2: Patience Sorting To Find Longest Increasing Subsequenceby Anonymous Monk |
on Oct 07, 2009 at 19:04 UTC ( [id://799784]=note: print w/replies, xml ) | Need Help?? |
cool thing to do is using binary..search..
if you have word cat means 3 alpha...2^m=2^3=8
so
000= 0 now sub sequences.
001=t
010=a
011=at
100=c
101=at
110=ca
111=cat
In Section
Meditations
|
|