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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
