Problem 51. Find the two most distant points

Solution 387795

Submitted on 17 Jan 2014 by Jon

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Jon on 17 Jan 2014

Without dist, but with str2num

Carl Witthoft on 23 Nov 2015

I think it works w/ just x*[1;i] . No need to convert from a string.

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))
2	Pass	%% p = [0 0; 1 0; 2 2; 0 10]; ix_correct = [2 4]; assert(isequal(mostDistant(p),ix_correct))
3	Pass	%% p = [0 0; -1 50]; ix_correct = [1 2]; assert(isequal(mostDistant(p),ix_correct))
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))