Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1:5;
y_correct = [-0.858407346410207 0.474925986923126 -0.325074013076874 0.246354558351698 -0.198089886092747];
answers = pi_approx(n);
for i = 1:numel(n)
assert(abs(answers(i)-y_correct(i))<(100*eps))
end
|
2 | Pass |
n = 2:2:10;
y_correct = [0.474925986923126 0.246354558351698 0.165546477543617 0.124520836517975 0.099753034660390];
answers = pi_approx(n);
for i = 1:numel(n)
assert(abs(answers(i)-y_correct(i))<(100*eps))
end
|
3 | Pass |
n = 5:5:25;
y_correct = [-0.198089886092747 0.099753034660390 -0.066592998672151 0.049968846921953 -0.039984031845239];
answers = pi_approx(n);
for i = 1:numel(n)
assert(abs(answers(i)-y_correct(i))<(100*eps))
end
|
4 | Pass |
n = 10:10:100;
y_correct = [0.099753034660390 0.049968846921953 0.033324086890846 0.024996096795960 0.019998000998782 0.016665509660796 0.014284985608559 0.012499511814072 0.011110768228485 0.009999750031239];
answers = pi_approx(n);
for i = 1:numel(n)
assert(abs(answers(i)-y_correct(i))<(100*eps))
end
|
Back to basics 4 - Search Path
280 Solvers
153 Solvers
403 Solvers
311 Solvers
171 Solvers