Algorithms - Recursion

someRecursive.js

function someRecursive(arr, fn) {
    // Return false if arr is empty
    if (arr.length === 0) return false;
    // if function returns true on first element in array 
    if (fn(arr[0])) return true;
    // else slice array and re run function
    return someRecursive(arr.slice(1), fn);
}

// SAMPLE INPUT / OUTPUT
// Return true if fn returns true to any element in array else return false
const isOdd = val => val % 2 !== 0;

// someRecursive([1,2,3,4], isOdd) // true
// someRecursive([4,6,8,9], isOdd) // true
// someRecursive([4,6,8], isOdd) // false
// someRecursive([4,6,8], val => val > 10); // false