Cody

Problem 51. Find the two most distant points

Solution 292361

Submitted on 30 Jul 2013 by Matthew M.
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))

m = 0 2.2361 2.8284 1.0000 iCol = 1 2 1 1 iRow = 3 ans = 1 3

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

m = 0 8.2462 10.0499 10.0000 iCol = 1 3 2 1 iRow = 3 ans = 2 4

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

m = 0 50.0100 iCol = 1 1 iRow = 2 ans = 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))

m = 1.0e+03 * 0 1.1638 1.0734 1.0744 1.0761 1.0705 iCol = 1 5 4 3 2 1 iRow = 2 ans = 5 6