Cody

Problem 51. Find the two most distant points

Solution 61606

Submitted on 15 Mar 2012 by Stephen
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))

p = 8 5 5 0 ind = 1 2 4 3

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

p = 101 100 68 0 ind = 2 1 3 4

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

p = 2501 0 ind = 2 1

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

p = 1354400 1158001 1154408 1152100 1146050 0 ind = 5 2 3 4 1 6

Suggested Problems

More from this Author95