A solution for Divisor Algorithm

calculator.js

// This script finds the greatest common divisor of two numbers

function findGreatestCommonDivisor(a, b){
    var divisor = 1;
    
    if(a < 0)
      a *= -1;
      
    if(b < 0)  
      b *= -1;
      
    if(a < b) {
        var temp = b;
        b = a;
        a = temp;
    }
    
    var remainder = b;
    
    while(remainder > 0){
        remainder = a % b;
        
        if(remainder == 0){
            divisor = b;
            break;
        }
        else{
            a = b;
            b = remainder;
        }
    }
    
    return divisor;
}