@Shashank: Regarding the complexity, let's say that you are dividing 15 by 1. The on the original call, you will shift 4 times, on the first recursive call, 3 times, then 2 times, then 1 time. This is a total of ten shifts. This is log(quotient) * (log(quotient) - 1) / 2, which is O(log(quotient)^2).
Dave On Aug 25, 7:23 am, WgpShashank <shashank7andr...@gmail.com> wrote: > @Dave Yup, but Overall Complexity Will remain O(log(Quotient)) as > y=logn^k=klogn=O(logn) where k is constant > isn't it ? Also case of -Ive Numbers Can be handled easily :) > > *Thanks > Shashank Mani > Computer Science > Birla Institute of Technology Mesra* -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
