http://en.wikipedia.org/wiki/Longest_increasing_subsequence
On 6 September 2010 14:01, bittu <shashank7andr...@gmail.com> wrote:
> u are given an array and u have to print the longest increasing
> scattered subsequence...eg..{11,9,8,2,10,7,3,4,5}.
>
>
> Solve it O(n);
>
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Geeks" group.
> To post to this group, send email to algoge...@googlegroups.com.
> To unsubscribe from this group, send email to
> algogeeks+unsubscr...@googlegroups.com<algogeeks%2bunsubscr...@googlegroups.com>
> .
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>
--
Vignesh Radhakrishnan
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
