Cody

# Problem 51. Find the two most distant points

Solution 318796

Submitted on 13 Sep 2013 by Pedro Villena
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))

ans = 0.0000 + 0.0000i 1.0000 + 0.0000i 2.0000 + 2.0000i 0.0000 + 1.0000i

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

ans = 0.0000 + 0.0000i 1.0000 + 0.0000i 2.0000 + 2.0000i 0.0000 +10.0000i

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

ans = 0.0000 + 0.0000i -1.0000 +50.0000i

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

ans = 1.0e+03 * 0.0050 + 0.0050i 0.0010 + 0.0000i 0.0020 + 0.0020i 0.0000 + 0.0100i -0.1000 + 0.0200i 1.0000 + 0.4000i

### Community Treasure Hunt

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

Start Hunting!