euclid-gcd.js

function euclidGreatestCommonFactor(numOne, numTwo){
  if (numOne > numTwo) {
    var larger = numOne;
    var smaller = numTwo;
  }
  else {
    var larger = numTwo;
    var smaller = numOne;
  }

  var remainder = larger % smaller;

  if (!(remainder === 0)) {
    console.log(remainder);
    return euclidGreatestCommonFactor(smaller, remainder);
  }
}