Cody

Problem 29. Nearest Numbers

Solution 1892928

Submitted on 6 Aug 2019 by Todd Snow
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))

mindiff = 16 x = 2 1 mindiff = 11 x = 2 5 mindiff = 2 x = 2 6 mindiff = 1 x = 8 9 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))

mindiff = 1393 x = 2 4 mindiff = 1058 x = 2 5 mindiff = 740 x = 2 7 mindiff = 506 x = 3 1 mindiff = 112 x = 3 9 index1 = 3 index2 = 9

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

mindiff = 2 x = 2 1 index1 = 1 index2 = 2

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

index1 = 1 index2 = 5

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

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

mindiff = 630 x = 2 1 mindiff = 291 x = 2 3 mindiff = 95 x = 2 4 mindiff = 5 x = 2 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))

mindiff = 1754 x = 2 1 mindiff = 1201 x = 2 4 mindiff = 553 x = 4 1 index1 = 1 index2 = 4