Cody

Problem 51. Find the two most distant points

Solution 89556

Submitted on 17 May 2012 by Richard Zapor
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))

x = 0 1.0000 2.8284 1.0000 1.0000 0 2.2361 1.4142 2.8284 2.2361 0 2.2361 1.0000 1.4142 2.2361 0 ix = 1 3

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

x = 0 1.0000 2.8284 10.0000 1.0000 0 2.2361 10.0499 2.8284 2.2361 0 8.2462 10.0000 10.0499 8.2462 0 ix = 2 4

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

x = 0 50.0100 50.0100 0 ix = 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))

x = 1.0e+03 * 0 0.0064 0.0042 0.0071 0.1061 1.0705 0.0064 0 0.0022 0.0100 0.1030 1.0761 0.0042 0.0022 0 0.0082 0.1036 1.0744 0.0071 0.0100 0.0082 0 0.1005 1.0734 0.1061 0.1030 0.1036 0.1005 0 1.1638 1.0705 1.0761 1.0744 1.0734 1.1638 0 ix = 5 6

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Start Hunting!