I suppose the heading of the mail makes it clear , if its not i m takin about Longest Increasing Subsequence in O(nlogn)
On Fri, May 28, 2010 at 9:49 PM, Anand <[email protected]> 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 <[email protected]> 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 [email protected]. >> To unsubscribe from this group, send email to >> [email protected]<algogeeks%[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]<algogeeks%[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.
