Consider the problem of computing xy for given integers x and y: we want the whole answer, not modulo a third integer. We know two algorithms for doing this: the iterative algorithm which performs y − 1 multiplications by x; and the recursive algorithm based on the binary expansion of y.
Compare the time requirements of these two algorithms, assuming that the time to multiply an n-bit number by an m-bit number is O (mn).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.