primeMemoize.js

// A function that returns true  if a number is prime
function isPrime(num) {
    let numIsPrime = true;
    if (num === 1) {
        return false;
    }
    for (let i = 2; i < num; i++) {
        if (num % i === 0) {
            numIsPrime = false;
            console.log(i);
            break
        }
    }
    return numIsPrime
}
// console.log(isPrime(157))

// A function that returns a memoized version of any other function
function memorize(func) {
    let resultsCache = {};
    return (num) => {
        if (num in resultsCache) {
            console.log("Reading from cache...");
            return resultsCache[num];
        }
        console.log("Running function...");
        let result = func(num);
        resultsCache[num] = result;
        return result;
    }
}

const memoizedPrime = memorize(isPrime);
console.log(memoizedPrime(157))
console.log(memoizedPrime(157))
console.log(memoizedPrime(157))