How to use Binomial Coefficient Formula In Javascript

Using Recursion

This approach relies on the binomial coefficient formula to compute the value of each element in the nth row of Pascal’s triangle. The binomial coefficient formula calculates the number of ways to choose k elements from a set of n elements denoted as “C(n, k)”.

The formula for binomial coefficient is:

C(n, k) = n! / (k! * (n - k)!)

Example: This example prints the n-th row of Pascal’s triangle using binomial coefficient formula.

JavaScript

function pascalsRow(n) {
    let row = [];
    for (let i = 0; i <= n; i++) {
        row.push(binomial(n, i));
    }
    return row;
}

function binomial(n, k) {
    let result = 1;
    for (let i = 1; i <= k; i++) {
        result *= (n - i + 1) / i;
    }
    return result;
}

console.log(pascalsRow(3));

Output

[ 1, 3, 3, 1 ]

Time Complexity: O(N²)

Space Complexity: O(N)

JavaScript Program to Print the Nth Row of Pascal’s Triangle

Pascal’s triangle is a triangular array of binomial coefficients. Each number in the triangle is the sum of the two directly above it.

Given a non-negative integer N, the task is to find the Nth row of Pascal’s Triangle.

Table of Content

Using Binomial Coefficient Formula
Using Recursion

Tags:

#JavaScript Programs #JavaScript #Web Technologies

Using Recursion

How to use Binomial Coefficient Formula In Javascript

JavaScript Program to Print the Nth Row of Pascal’s Triangle

Similar Reads