We used a subfunction Cpn(n,p)
Y=factorial(p)/(factorial(n)*factorial(p-n)) instead of the function "nchoosek" .
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 0;
correct = [1];
assert(isequal(pascalTri(n),correct))
|
2 | Pass |
%%
n = 1;
correct = [1 1];
assert(isequal(pascalTri(n),correct))
|
3 | Pass |
%%
n = 2;
correct = [1 2 1];
assert(isequal(pascalTri(n),correct))
|
4 | Pass |
%%
n = 3;
correct = [1 3 3 1];
assert(isequal(pascalTri(n),correct))
|
5 | Pass |
%%
n = 10;
correct = [1 10 45 120 210 252 210 120 45 10 1];
assert(isequal(pascalTri(n),correct))
|
522 Solvers
187 Solvers
Getting the indices from a matrice
268 Solvers
262 Solvers
264 Solvers