use divide and conquer . logm complexity . . . On Sat, Jul 30, 2011 at 1:09 PM, saurabh singh <saurab...@gmail.com> wrote:
> o(log n) > x^n=pow(x^n/2)*pow(x^n/2)*(x^mod2) > > the base case pow(x,1)=x pow(x,0)=1 > > On Sat, Jul 30, 2011 at 1:02 PM, arvind kumar <arvindk...@gmail.com>wrote: > >> Find the least time complexity algorithm(most efficient algo) to find >> x^m(x to the power of m)..Facebok intern interview question! >> >> -- >> 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. >> >> > > > -- > Saurabh Singh > B.Tech (Computer Science) > MNNIT ALLAHABAD > > > -- > 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. > -- Ankur Khurana Computer Science Netaji Subhas Institute Of Technology Delhi. -- 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.
