Hi, you can find the answers on the book "The Art of Computer Programming" of Knuth, volume 2, known as "Seminumerical Algorithms".
Good luck! On 8 sep, 23:13, mukesh tiwari <[EMAIL PROTECTED]> wrote: > hello everybody . > for a given value i have to find a lowest possible steps in > exponation . i searched on net and i find three ways binary method > [steps will be log2(n)+number of 1 bits in binary expression of n > -1] ,factor method [l(n)=1+l(n-1) if n is prime else n=k*p then > l(n)=l(k)+l(p)] . now my problem is that i don't have algorithm for > power tree so that i can compare all the three vlaues to find out > lowest value . thnkx --~--~---------~--~----~------------~-------~--~----~ 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 [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
