@bbx-audio/nectar
Preparing search index...
findGreatestCommonDivisor
Function findGreatestCommonDivisor
findGreatestCommonDivisor
(
a
:
number
,
b
:
number
)
:
number
Finds the greatest common divisor of two integers using Euclid's algorithm.
Parameters
a
:
number
b
:
number
Returns
number
Settings
Member Visibility
Protected
Inherited
External
Theme
OS
Light
Dark
@bbx-audio/nectar
Loading...
Finds the greatest common divisor of two integers using Euclid's algorithm.