Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
Euclidian algorithm: recursion solution in Clear category for The Greatest Common Divisor by lolucky
var greatestCommonDivisor = (...r) => r.reduce(f),
f = (a,b) => a ? f(b%a,a) : b
Nov. 21, 2020
Comments:
