Cody

# Problem 51. Find the two most distant points

Solution 1405286

Submitted on 5 Jan 2018 by Martin C.
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))

md = 0 x = 0 0 md = 1 x = 1 2 md = 2.8284 x = 1 3

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

md = 0 x = 0 0 md = 1 x = 1 2 md = 2.8284 x = 1 3 md = 10 x = 1 4 md = 10.0499 x = 2 4

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

md = 0 x = 0 0 md = 50.0100 x = 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))

md = 0 x = 0 0 md = 6.4031 x = 1 2 md = 7.0711 x = 1 4 md = 106.0660 x = 1 5 md = 1.0705e+03 x = 1 6 md = 1.0761e+03 x = 2 6 md = 1.1638e+03 x = 5 6