Cody

# Problem 51. Find the two most distant points

Solution 1218183

Submitted on 22 Jun 2017 by Augusto Mazzei
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))

d = 1 d = 8 d = 1 d = 5 d = 2 d = 5

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

d = 1 d = 8 d = 100 d = 5 d = 101 d = 68

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

d = 2501

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

d = 41 d = 18 d = 50 d = 11250 d = 1146050 d = 5 d = 101 d = 10601 d = 1158001 d = 68 d = 10728 d = 1154408 d = 10100 d = 1152100 d = 1354400

### Community Treasure Hunt

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

Start Hunting!