in reply to Re: Patience Sorting To Find Longest Increasing Subsequence
in thread Patience Sorting To Find Longest Increasing Subsequence
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