algorithm 3.2

bin2.js

function bin2(n, k)
{
    const B = new Array(n+1).fill(0).map((x) => {
        return new Array(k+1).fill(0);
    });

    for (let i = 0; i <= n; i++) {
        for (let j = 0; j <= Math.min(i,k); j++) {
            if (j === 0 || j === i) {
                B[i][j] = 1;
            }
            else {
                B[i][j] = B[i-1][j-1] + B[i-1][j];
            }
        }
    }

    return B[n][k];
}