mirror of
https://github.com/TheAlgorithms/JavaScript.git
synced 2025-07-04 07:29:47 +08:00
86d333ee94
* chore: Switch to Node 20 + Vitest * chore: migrate to vitest mock functions * chore: code style (switch to prettier) * test: re-enable long-running test Seems the switch to Node 20 and Vitest has vastly improved the code's and / or the test's runtime! see #1193 * chore: code style * chore: fix failing tests * Updated Documentation in README.md * Update contribution guidelines to state usage of Prettier * fix: set prettier printWidth back to 80 * chore: apply updated code style automatically * fix: set prettier line endings to lf again * chore: apply updated code style automatically --------- Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com> Co-authored-by: Lars Müller <34514239+appgurueu@users.noreply.github.com>
23 lines
551 B
JavaScript
23 lines
551 B
JavaScript
/*
|
|
Modified from:
|
|
https://github.com/TheAlgorithms/Python/blob/master/maths/binary_exp_mod.py
|
|
|
|
Explanation:
|
|
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 }
|