Cody

Solution 1828046

Submitted on 28 May 2019 by Olivia Li
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))

s = 1 2 16 s = 1 3 14 s = 1 5 5 s = 1 8 4 s = 2 6 2 s = 8 9 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))

s = 1 2 4843 s = 1 3 506 s = 1 9 394 s = 3 9 112

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

s = 1 2 2

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

s = 1 2 1000 s = 1 5 0

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

s = 1 2 1 s = 1.0e+03 * 0.0010 1.0010 0.0005

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

s = 1 2 630 s = 1 3 339 s = 2 3 291 s = 2 4 95 s = 2 5 5

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

s = 1 2 1754 s = 1 4 553

Suggested Problems

More from this Author95