FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
JavaScript/Maths/ModularBinaryExponentiationRecursive.js at master · Baruda/JavaScript · GitHub
Baruda
/
JavaScript
Public
forked from
TheAlgorithms/JavaScript
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
JavaScript
/
Maths
/
ModularBinaryExponentiationRecursive.js
Copy path
More file actions
More file actions
Latest commit
History
History
History
22 lines (19 loc) · 551 Bytes
Breadcrumbs
JavaScript
/
Maths
/
ModularBinaryExponentiationRecursive.js
Copy path
File metadata and controls
22 lines (19 loc) · 551 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
/*
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
}
Back
|
FazBrowse Home
|
New Git URL