Find the greatest common divisor (GCD) of two numbers using the Euclidean algorithm.
Code
Algorithmsconst gcd = (x, y) => y === 0 ? x : gcd(y, x % y);
return gcd(a, b);Parameters
First number
Second number
Browser·fetch() may be limited by CORS
More JavaScript Snippets
Binary to Decimal
Convert a binary string representation to its decimal number equivalent.
Bytes to Human Readable
Convert bytes to human readable format (KB, MB, GB, etc.) for file sizes.
Calculate Median
Calculate the median value of an array of numbers.
Calculate Mode
Find the most frequent value(s) in an array.
Calculate Percentile
Calculate the nth percentile of an array using linear interpolation.
Celsius to Fahrenheit
Convert temperature from Celsius to Fahrenheit using the standard formula.