Cody

Problem 81. Mandelbrot Numbers

Solution 728293

Submitted on 3 Sep 2015 by Ian Riley
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

Test Status Code Input and Output
1   Pass
%% C = 0; lim = 5; N_correct = 5; assert(isequal(mandelbrot(C,lim),N_correct))

z = 0 z = 0 N = 1 z = 0 N = 2 z = 0 N = 3 z = 0 N = 4 z = 0 N = 5

2   Pass
%% C = [0 0.5; 1 4]; lim = 5; N_correct = [5 4; 2 1]; assert(isequal(mandelbrot(C,lim),N_correct))

z = 0 z = 0 N = 1 0 0 0 z = 0 N = 2 0 0 0 z = 0 N = 3 0 0 0 z = 0 N = 4 0 0 0 z = 0 N = 5 0 0 0 z = 1 z = 2 N = 5 0 1 0 z = 5 N = 5 0 2 0 z = 0.5000 z = 0.7500 N = 5 1 2 0 z = 1.0625 N = 5 2 2 0 z = 1.6289 N = 5 3 2 0 z = 3.1533 N = 5 4 2 0 z = 4 z = 20 N = 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))

z = 0.0000 + 1.0000i z = -1.0000 + 1.0000i N = 1 0 0 0 z = 0.0000 - 1.0000i N = 2 0 0 0 z = -1.0000 + 1.0000i N = 3 0 0 0 z = 0.0000 - 1.0000i N = 4 0 0 0 z = -1.0000 + 1.0000i N = 5 0 0 0 z = 0.0000 - 1.0000i N = 6 0 0 0 z = -1.0000 + 1.0000i N = 7 0 0 0 z = 0.0000 - 1.0000i N = 8 0 0 0 z = -1.0000 + 1.0000i N = 9 0 0 0 z = 0.0000 - 1.0000i N = 10 0 0 0 z = 1 z = 2 N = 10 1 0 0 z = 5 N = 10 2 0 0 z = 0.0000 - 2.0000i z = -4.0000 - 2.0000i N = 10 2 1 0 z = -2 z = 2 N = 10 2 1 1 z = 2 N = 10 2 1 2 z = 2 N = 10 2 1 3 z = 2 N = 10 2 1 4 z = 2 N = 10 2 1 5 z = 2 N = 10 2 1 6 z = 2 N = 10 2 1 7 z = 2 N = 10 2 1 8 z = 2 N = 10 2 1 9 z = 2 N = 10 2 1 10