Cody

# Problem 51. Find the two most distant points

Solution 2623690

Submitted on 28 Jun 2020 by Anvitha S
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
p = [0 0; 1 0; 2 2; 0 1]; ix_correct = [1 3]; assert(isequal(mostDistant(p),ix_correct))

m = 0 1.0000 2.8284 1.0000 0 0 2.2361 1.4142 0 0 0 2.2361 0 0 0 0 row = 1 col = 3 ix = 1 3

2   Pass
p = [0 0; 1 0; 2 2; 0 10]; ix_correct = [2 4]; assert(isequal(mostDistant(p),ix_correct))

m = 0 1.0000 2.8284 10.0000 0 0 2.2361 10.0499 0 0 0 8.2462 0 0 0 0 row = 2 col = 4 ix = 2 4

3   Pass
p = [0 0; -1 50]; ix_correct = [1 2]; assert(isequal(mostDistant(p),ix_correct))

m = 0 50.0100 0 0 row = 1 col = 2 ix = 1 2

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))

m = 1.0e+03 * 0 0.0064 0.0042 0.0071 0.1061 1.0705 0 0 0.0022 0.0100 0.1030 1.0761 0 0 0 0.0082 0.1036 1.0744 0 0 0 0 0.1005 1.0734 0 0 0 0 0 1.1638 0 0 0 0 0 0 row = 5 col = 6 ix = 5 6