mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-15 02:33:35 +08:00
e112434dee
* Add prettier config * test: add test to check for absolute function * chore: es5 to es6 * test: add test to check mean function * test: add test for sum of digit * test: add test for factorial * test: add test for fibonnaci * test: add test for find HCF * test: add test for lcm * test: add gridget test * test: add test for mean square error * test: add test for modular binary exponentiation * test: add tests for palindrome * test: add test for pascals triangle * test: add tests for polynomial * test: add tests for prime check * test: add tests for reverse polish notation * test: add tests for sieve of eratosthenes * test: add tests for pi estimation monte carlo method * chore: move tests to test folder * chore: fix standardjs errors
23 lines
574 B
JavaScript
23 lines
574 B
JavaScript
/*
|
|
Modified from:
|
|
https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py
|
|
|
|
Explaination:
|
|
https://en.wikipedia.org/wiki/Exponentiation_by_squaring
|
|
*/
|
|
|
|
const modularBinaryExponentiation = (a, n, m) => {
|
|
// input: a: int, n: int, m: int
|
|
// returns: (a^n) % m: int
|
|
if (n === 0) {
|
|
return 1
|
|
} else if (n % 2 === 1) {
|
|
return (modularBinaryExponentiation(a, n - 1, m) * a) % m
|
|
} else {
|
|
const b = modularBinaryExponentiation(a, n / 2, m)
|
|
return (b * b) % m
|
|
}
|
|
}
|
|
|
|
export { modularBinaryExponentiation }
|