can be done with nlogn ....i dont think so O(n) is possible... On 17 Dec 2013 01:30, "bujji jajala" <[email protected]> wrote:
> Given an Array of integers (A1,A2,...,An) of length n, Find the maximum > possible length of increasing sub sequence formed from A1, A2,....,An. > > > I read that it is possible to compute in linear time as mentioned in > algorithm design manual bySkiena. > > -Thanks > Bujji > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected].
