javascript使用辗转相除法实现求两个数的最大公因数

javascript使用辗转相除法实现求两个数的最大公因数

// 传入两个整数
function divisionAlgorithm(divisor, divident){
	   if(divisor<divident){
	        divisor = divisor + divident;
	        divident = divisor - divident;
	        divisor = divisor - divident;
	    }
	    var mod,result; 
	    if(divident===0){
	        return divisor;
	    }
	    mod = divisor%divident;
	    result=divisionAlgorithm(divident,mod);
	    if(result!=undefined){
	        return result
	    }
}
console.log(divisionAlgorithm(104,40));		// 8
console.log(divisionAlgorithm(30,45));		// 15

课下随便写写，欢迎大家给出意见~