As you can see, each time, we are either discarding 1st half of A or second half of A. Same for B.
So, the total size is getting reduced by factor of 2 every time. So, the time is log(N) where N = sizeA + sizeB. I hope it is clear. On Fri, Sep 2, 2011 at 12:47 AM, Rahul Verma <[email protected]>wrote: > @jay could you please explain that how you know that the complexity is > log(sizeA + sizeB). > > If you don't mind then could you please explain it in detail. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To view this discussion on the web visit > https://groups.google.com/d/msg/algogeeks/-/YHMj8hRnKS4J. > 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. > -- Regards, -Jay Mahadeokar MTech Final Year, CSE. IIT Kanpur. -- 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.
