@Senthilnathan: topological sort can be done in O(n) and we can solve LIS in O(n^2) (i'm not sure if the nlogn approach for LIS can be applied here)
On 6/26/10, Senthilnathan Maadasamy <[email protected]> wrote: > @Amir : What is the complexity of your approach? > > -- > 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. > > -- 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.
