Test  Status  Code Input and Output 

1  Pass 
user_solution = fileread('hexagonal_dots_in_circle.m');
assert(isempty(strfind(user_solution,'regexp')));
assert(isempty(strfind(user_solution,'2str')));
assert(isempty(strfind(user_solution,'str2')));
assert(isempty(strfind(user_solution,'interp')));
assert(isempty(strfind(user_solution,'printf')));
assert(isempty(strfind(user_solution,'assert')));

2  Pass 
r = 0;
n_correct = 1;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

3  Pass 
r = 0.5;
n_correct = 1;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

4  Pass 
r = 1;
n_correct = 7;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

5  Pass 
r = 1.5;
n_correct = 7;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

6  Pass 
r = 2;
n_correct = 19;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

7  Pass 
r = 2.5;
n_correct = 19;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

8  Pass 
r = 3;
n_correct = 37;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

9  Pass 
r = 5;
n_correct = 91;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

10  Pass 
r = 7.5;
n_correct = 199;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

11  Pass 
r = 10;
n_correct = 367;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

12  Pass 
r = 15;
n_correct = 823;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

13  Pass 
r = 20;
n_correct = 1459;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

14  Pass 
r = 25;
n_correct = 2263;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

15  Pass 
r = 50;
n_correct = 9061;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

16  Pass 
r = 100;
n_correct = 36295;
assert(isequal(hexagonal_dots_in_circle(r),n_correct));
[Warning: Polynomial is badly conditioned. Add points with distinct X values, reduce the degree of the polynomial, or try centering and scaling as described in HELP POLYFIT.]

1172 Solvers
3707 Solvers
"Low : High  Low : High  Turn around "  Create a subindices vector
325 Solvers
166 Solvers
Getting the row and column location from a matrix
222 Solvers