Cody

# Problem 51. Find the two most distant points

Solution 1980269

Submitted on 17 Oct 2019 by Manuel Donald-Lopez
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))

xydist = 1 xydist = 2.8284 xydist = 1 xydist = 2.2361 xydist = 1.4142 xydist = 2.2361

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

xydist = 1 xydist = 2.8284 xydist = 10 xydist = 2.2361 xydist = 10.0499 xydist = 8.2462

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

xydist = 50.0100

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

xydist = 6.4031 xydist = 4.2426 xydist = 7.0711 xydist = 106.0660 xydist = 1.0705e+03 xydist = 2.2361 xydist = 10.0499 xydist = 102.9612 xydist = 1.0761e+03 xydist = 8.2462 xydist = 103.5761 xydist = 1.0744e+03 xydist = 100.4988 xydist = 1.0734e+03 xydist = 1.1638e+03