isEven Function Comparison Demo

Source Code

// Overcomplicated isEven function using recursive loop
function isEvenOvercomplicated(n) {
    if (n < 0) return isEvenOvercomplicated(-n);
    if (n === 0) return true;
    if (n === 1) return false;
    
    let count = 0;
    let current = n;
    
    while (count < n) {
        current--;
        count++;
        if (current === 0) return true;
        if (current === 1) return false;
    }
    
    return isEvenOvercomplicated(current);
}

// Simplified isEven function using modulo check
function isEvenSimple(n) {
    return n % 2 === 0;
}