Cody

# Problem 29. Nearest Numbers

Solution 1970740

Submitted on 10 Oct 2019 by Dhruvum Bajpai
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
A = [30 46 16 -46 35 44 18 26 25 -10]; correct = [8 9]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 16 index1 = 1 index2 = 2 minimum = 14 index1 = 1 index2 = 3 minimum = 5 index1 = 1 index2 = 5 minimum = 4 index1 = 1 index2 = 8 minimum = 2 index1 = 2 index2 = 6 minimum = 1 index1 = 8 index2 = 9

2   Pass
A = [1555 -3288 2061 -4681 -2230 -4538 -4028 3235 1949 -1829]; correct = [3 9]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 4843 index1 = 1 index2 = 2 minimum = 506 index1 = 1 index2 = 3 minimum = 394 index1 = 1 index2 = 9 minimum = 112 index1 = 3 index2 = 9

3   Pass
A = [-1 1 10 -10]; correct = [1 2]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 2 index1 = 1 index2 = 2

4   Pass
A = [0 1000 -2000 1001 0]; correct = [1 5]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 1000 index1 = 1 index2 = 2 minimum = 0 index1 = 1 index2 = 5

5   Pass
A = [1:1000 0.5]; correct = [1 1001]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 1 index1 = 1 index2 = 2 minimum = 0.5000 index1 = 1 index2 = 1001

6   Pass
% Area codes A = [847 217 508 312 212]; correct = [2 5]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 630 index1 = 1 index2 = 2 minimum = 339 index1 = 1 index2 = 3 minimum = 291 index1 = 2 index2 = 3 minimum = 95 index1 = 2 index2 = 4 minimum = 5 index1 = 2 index2 = 5

7   Pass
% Zip codes A = [60048 61802 01702 60601 10001]; correct = [1 4]; [i1 i2] = nearestNumbers(A); assert(isequal([i1 i2],correct))

minimum = 1754 index1 = 1 index2 = 2 minimum = 553 index1 = 1 index2 = 4