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

課下隨便寫寫，歡迎大家給出意見~