Cody

Problem 51. Find the two most distant points

Solution 395733

Submitted on 3 Feb 2014 by priyanka shrivastava
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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 = 2.8284 2.2361 2.8284 2.2361 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 = 10.0000 10.0499 8.2462 10.0499 ans = 2 4

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

m = 50.0100 50.0100 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 * 1.0705 1.0761 1.0744 1.0734 1.1638 1.1638 ans = 5 6

Suggested Problems

More from this Author95