JavaScript: Greatest Common Divisor

gcd.js

// JavaScript: Greatest Common Divisor
var gcd = function (n, m) {
  var r = 0;
  while (n !== 0) {
    r = m % n;
    m = n;
    n = r;
  }
  return m;
};

js: gcd

var gcd = function (n, m) {
  var r = 0;
  while (n !== 0) {
    r = m % n;
    m = n;
    n = r;
  }
  return m;
};

var gcd = function(a, b) {
if ( ! b) {
return a;
}

return gcd(b, a % b);

};