matlab coding Develop a recursive formula for the binomial c

matlab coding

Develop a recursive formula for the binomial coefficient B(m, r) = (m r).

Solution

function output = binomialcoefficient(n,k) // function to calculate the output

if ( k==0 || n==k) //base since [nC0 and nCn = 1]

output = 1;

else

output = binomialcoefficient(n-1,k-1) + binomialcoefficient(n-1,k); //ekse used recursion

end

in order to solve the problem with most benefit way use the recursion with DP

function output2 = binomialcoefficient(n, k)

DP = zeroes(n+1,k+1);

for i=1:n+1

for j=1;k+1

if(j==1 || j==i)

B[i][j]=1;

else

B[i][j] = B[i-1][j-1] + B[i-1][j];

end

end

end

output2 = Binomialcoefficient(n,k);