This is the smallest solution not to use "dist," which is not in core Matlab. Nicely done!
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
p = [0 0;
1 0;
2 2;
0 1];
ix_correct = [1 3];
assert(isequal(mostDistant(p),ix_correct))
|
2 | Pass |
%%
p = [0 0;
1 0;
2 2;
0 10];
ix_correct = [2 4];
assert(isequal(mostDistant(p),ix_correct))
|
3 | Pass |
%%
p = [0 0;
-1 50];
ix_correct = [1 2];
assert(isequal(mostDistant(p),ix_correct))
|
4 | Pass |
%%
p = [5 5;
1 0;
2 2;
0 10;
-100 20;
1000 400];
ix_correct = [5 6];
assert(isequal(mostDistant(p),ix_correct))
|
Make a random, non-repeating vector.
2797 Solvers
Vectorize the digits of an Integer
269 Solvers
Sum of odd numbers in a matrix
311 Solvers
359 Solvers
2039 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!