Cody

# Problem 51. Find the two most distant points

Solution 2001193

Submitted on 3 Nov 2019 by Hong Zhang
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))

ix = 1 2 cur = 0 cur = 1 cur = 4 cur = 1 cur = 0 cur = 3 cur = 2 cur = 0 cur = 3

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

ix = 1 2 cur = 0 cur = 1 cur = 4 cur = 10 cur = 0 cur = 3 cur = 11 cur = 0 cur = 10

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

ix = 1 2 cur = 0 cur = 51

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

ix = 1 2 cur = 0 cur = 9 cur = 6 cur = 10 cur = 120 cur = 1390 cur = 0 cur = 3 cur = 11 cur = 121 cur = 1399 cur = 0 cur = 10 cur = 120 cur = 1396 cur = 0 cur = 110 cur = 1390 cur = 0 cur = 1480

### Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!