Problem 51. Find the two most distant points

Solution 3698128

Submitted on 17 Nov 2020 by Predrag Vukovic

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

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)) Most distant rows [d=2.8] are [1,3].
2	Pass	p = [0 0; 1 0; 2 2; 0 10]; ix_correct = [2 4]; assert(isequal(mostDistant(p),ix_correct)) Most distant rows [d=10.0] are [2,4].
3	Pass	p = [0 0; -1 50]; ix_correct = [1 2]; assert(isequal(mostDistant(p),ix_correct)) Most distant rows [d=50.0] are [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)) Most distant rows [d=1163.8] are [5,6].

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

Start Hunting!