@Ankur: Maybe http://en.wikipedia.org/wiki/Euclidean_algorithm#Worst-case_number_of_steps will help.
Dave On Aug 3, 10:55 pm, Ankur Khurana <ankur.kkhur...@gmail.com> wrote: > Hi , > can you tell me that how do we arrive at the complexity of the repetitive > division theorem to find GCD. I tried to read it on net but was not able to > find a satisfactory answer. Is it log ( max(a,b)) or is it max of 5+max > number of digits(a,b) . . Can anybody clarify this and how you arrive at > this result as well. > > Regards, > Ankur Khurana -- 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.
