Cody

Problem 51. Find the two most distant points

Solution 267795

Submitted on 26 Jun 2013 by Preeyanka
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))

plength = 4 dist = 2.8284 itemp = 2 ix = 1 3

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

plength = 4 dist = 10 itemp = 3 ix = 1 4 dist = 10.0499 itemp = 2 ix = 2 4

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

plength = 2 dist = 50.0100 itemp = 1 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))

plength = 6 dist = 1.0705e+03 itemp = 5 ix = 1 6 dist = 1.0761e+03 itemp = 4 ix = 2 6 dist = 1.1638e+03 itemp = 1 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!