Enable Javascript in your browser and then refresh this page, for a much enhanced experience.
euclidian algorithm: while loop solution in Clear category for The Greatest Common Divisor by lolucky
var greatestCommonDivisor = (...r) => r.reduce((a,b) => {while(a) a=b%(b=a); return b})
Nov. 21, 2020
Comments: