Hi , I am looking for a Longest Increasing Subsequence Algorithm in O(nlogn) time. i.e given an array of integers we have to find the longest subsequence of it that is always increasing
e.g [3,5,2,7,12,1] ---> Ans[3,5,7,12] On May 28, 9:19 pm, Anand <anandut2...@gmail.com> wrote: > Hi Amit, > > Could you just elaborate which algorithm are you talking about. Is it KMP > algorithm for string matching are looking at. > > Thanks, > Anand > > On Fri, May 28, 2010 at 8:14 AM, amit <amitjaspal...@gmail.com> wrote: > > Hi , Can anyone plz explain this algorithm taking some example. > > I read this on wiki but could'nt get how binary search was working. > > > -- > > 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. -- 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.
