Cody

# Problem 51. Find the two most distant points

Solution 1790194

Submitted on 16 Apr 2019 by Chidvilashini Modala
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))

max = 1 ix = 1 2 ix = 1 2 ix = 1 3 max = 4

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

max = 1 ix = 1 2 ix = 1 2 ix = 1 3 max = 4 ix = 1 3 ix = 1 4 max = 10 ix = 2 4 ix = 2 4 max = 11

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

max = 51 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))

max = 9 ix = 1 2 ix = 1 2 ix = 1 4 max = 10 ix = 1 4 ix = 1 5 max = 120 ix = 1 5 ix = 1 6 max = 1390 ix = 2 6 ix = 2 6 max = 1399 ix = 5 6 ix = 5 6 max = 1480