Cody

# Problem 51. Find the two most distant points

Solution 3258563

Submitted on 18 Oct 2020 by Richard Thaxton
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))

s = 4 2 count = 1 max_dist = 0 dist = 0 dist = 1 max_dist = 1 points = 1 2 dist = 2.8284 max_dist = 2.8284 points = 1 3 dist = 1 count = 2 dist = 0 dist = 2.2361 dist = 1.4142 count = 3 dist = 0 dist = 2.2361 count = 4 dist = 0 count = 5

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

s = 4 2 count = 1 max_dist = 0 dist = 0 dist = 1 max_dist = 1 points = 1 2 dist = 2.8284 max_dist = 2.8284 points = 1 3 dist = 10 max_dist = 10 points = 1 4 count = 2 dist = 0 dist = 2.2361 dist = 10.0499 max_dist = 10.0499 points = 2 4 count = 3 dist = 0 dist = 8.2462 count = 4 dist = 0 count = 5

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

s = 2 2 count = 1 max_dist = 0 dist = 0 dist = 50.0100 max_dist = 50.0100 points = 1 2 count = 2 dist = 0 count = 3

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))

s = 6 2 count = 1 max_dist = 0 dist = 0 dist = 6.4031 max_dist = 6.4031 points = 1 2 dist = 4.2426 dist = 7.0711 max_dist = 7.0711 points = 1 4 dist = 106.0660 max_dist = 106.0660 points = 1 5 dist = 1.0705e+03 max_dist = 1.0705e+03 points = 1 6 count = 2 dist = 0 dist = 2.2361 dist = 10.0499 dist = 102.9612 dist = 1.0761e+03 max_dist = 1.0761e+03 points = 2 6 count = 3 dist = 0 dist = 8.2462 dist = 103.5761 dist = 1.0744e+03 count = 4 dist = 0 dist = 100.4988 dist = 1.0734e+03 count = 5 dist = 0 dist = 1.1638e+03 max_dist = 1.1638e+03 points = 5 6 count = 6 dist = 0 count = 7

### Community Treasure Hunt

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

Start Hunting!