Cody

Solution 1592278

Submitted on 26 Jul 2018 by Deepthi Palagati
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))

res = 16 res = 14 res = 5 res = 4 res = 2 c = 46 c = 46 c = 46 c = 46 c = 46 c = 46 res = 1

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

res = 506 res = 394 c = 3288 c = 3288 c = 3288 c = 3288 c = 3288 c = 3288 c = 3288 c = 3288 res = 112 c = 4681 c = 4681 c = 4681 c = 4681 c = 4681 c = 4681 c = 2230 c = 2230 c = 2230 c = 2230 c = 2230 c = 4538 c = 4538 c = 4538 c = 4538 c = 4028 c = 4028 c = 4028

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

c = 1 res = 2 c = 1 c = 1

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

res = 1000 res = 0 c = 2000 c = 2000

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

res = 1 res = 0.5000

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

res = 630 res = 339 res = 291 res = 95 res = 5

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

res = 1754 res = 553

Suggested Problems

More from this Author95