Problem 5. Triangle Numbers

Solution 394215

Submitted on 30 Jan 2014 by Matt

Size: 15
Leading solution size is 7.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

1 Comment

1 Comment

Matt on 30 Jan 2014

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 Suite

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))

Problem 5. Triangle Numbers

Test Suite

Suggested Problems

More from this Author95

Problem 5. Triangle Numbers

Test Suite

Suggested Problems

More from this Author95

Players