Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
C = 0;
lim = 5;
N_correct = 5;
assert(isequal(mandelbrot(C,lim),N_correct))
5
|
2 | Pass |
C = [0 0.5; 1 4];
lim = 5;
N_correct = [5 4; 2 1];
assert(isequal(mandelbrot(C,lim),N_correct))
5 4
2 1
|
3 | Pass |
i = sqrt(-1);
C = [i 1 -2*i -2];
lim = 10;
N_correct = [10 2 1 10];
assert(isequal(mandelbrot(C,lim),N_correct))
|
Find the peak 3n+1 sequence value
790 Solvers
Project Euler: Problem 10, Sum of Primes
555 Solvers
Return the 'Size' of a String of Code
116 Solvers
Back to basics 8 - Matrix Diagonals
707 Solvers
406 Solvers