Cody

# Problem 51. Find the two most distant points

Solution 1920081

Submitted on 3 Sep 2019 by Virtual AS
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))

l = -Inf 1 8 1 -Inf -Inf 5 2 -Inf -Inf -Inf 5 -Inf -Inf -Inf -Inf v = -Inf 1 8 5 c = 1 1 1 3 r = 3 ix = 1 3

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

l = -Inf 1 8 100 -Inf -Inf 5 101 -Inf -Inf -Inf 68 -Inf -Inf -Inf -Inf v = -Inf 1 8 101 c = 1 1 1 2 r = 4 ix = 2 4

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

l = -Inf 2501 -Inf -Inf v = -Inf 2501 c = 1 1 r = 2 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))

l = -Inf 41 18 50 11250 1146050 -Inf -Inf 5 101 10601 1158001 -Inf -Inf -Inf 68 10728 1154408 -Inf -Inf -Inf -Inf 10100 1152100 -Inf -Inf -Inf -Inf -Inf 1354400 -Inf -Inf -Inf -Inf -Inf -Inf v = -Inf 41 18 101 11250 1354400 c = 1 1 1 2 1 5 r = 6 ix = 5 6

### Community Treasure Hunt

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

Start Hunting!