This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 7;
y_correct = [exp(x) log(x) log10(x)];
[y_e,y_ln,y_log] = your_fcn_name(x);
y = [y_e,y_ln,y_log];
assert(sum(abs(y-y_correct))<1e-3)
|
2 | Pass |
x = 11;
y_correct = [exp(x) log(x) log10(x)];
[y_e,y_ln,y_log] = your_fcn_name(x);
y = [y_e,y_ln,y_log];
assert(sum(abs(y-y_correct))<1e-3)
|
3 | Pass |
x = 17;
y_correct = [exp(x) log(x) log10(x)];
[y_e,y_ln,y_log] = your_fcn_name(x);
y = [y_e,y_ln,y_log];
assert(sum(abs(y-y_correct))<1e-3)
|
4 | Pass |
x = 42;
y_correct = [exp(x) log(x) log10(x)];
[y_e,y_ln,y_log] = your_fcn_name(x);
y = [y_e,y_ln,y_log];
assert(sum(abs(y-y_correct))<1e-3)
|
5 | Pass |
x = 101;
y_correct = [exp(x) log(x) log10(x)];
[y_e,y_ln,y_log] = your_fcn_name(x);
y = [y_e,y_ln,y_log];
assert(sum(abs(y-y_correct))<1e-3)
|
Find the two most distant points
1234 Solvers
Make a random, non-repeating vector.
1115 Solvers
260 Solvers
348 Solvers
178 Solvers