Compared this solution score to sum(1:n). Using tic toc and varying sizes of n repeated up to 1,000,000 times I found that n*(n+1)/2 is by far faster. On the order of 10,000 times faster.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
t = 1;
assert(isequal(triangle(n),t))
|
2 | Pass |
%%
n = 3;
t = 6;
assert(isequal(triangle(n),t))
|
3 | Pass |
%%
n = 5;
t = 15;
assert(isequal(triangle(n),t))
|
4 | Pass |
%%
n = 30;
t = 465;
assert(isequal(triangle(n),t))
|
1582 Solvers
Set some matrix elements to zero
229 Solvers
261 Solvers
709 Solvers
Test Problem; Create a 5x5 array containing all ones
198 Solvers