int modpow(int x, int n, int m) { if (n == 0) return 1%m; int u = modpow(x,n/2,m); u = (u*u)%m; if (n%2 == 1) u = (u*x)%m; return u; }
Please explain modpow(x, n/2, m) call again and again when below its code execute.
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
int modpow(int x, int n, int m) { if (n == 0) return 1%m; int u = modpow(x,n/2,m); u = (u*u)%m; if (n%2 == 1) u = (u*x)%m; return u; }
Please explain modpow(x, n/2, m) call again and again when below its code execute.
Name |
---|
To understand how this works you need to know this following formula:
(A^n) % M = [ { (A^(n/2)) % M } * { (A^(n/2)) % M } ] % M [when n is even]
if n is odd then we can always write that
(A^n) % M = [ (A % M) * {(A^(n-1)) % M} ] % M [and now n-1 is even so we can apply the first formula]
This is the fundamental of binomial exponentiation. If you are required to calculate (A^N) % M in O(log N) time then this is the approach you should follow. If you still can't understand how that code works by calling itself in itself then I would suggest that you learn about recursions.
For more info: https://e-maxx-eng.appspot.com/algebra/binary-exp.html