Cody

Problem 176. Nearest

Solution 2056173

Submitted on 12 Dec 2019 by Asif Newaz
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
x = 3:10; y = 5.6; [v,i] = nearVal(x,y); assert(v == 6 && i == 4)

v = 6 i = 4

2   Pass
x = [1 1000]; y = 5.6; [v,i] = nearVal(x,y); assert(v == 1 && i == 1)

v = 1 i = 1

3   Pass
x = 1:500; y = 3:3:9; [v,i] = nearVal(x,y); assert(all(v == y & i == y))

v = 3 i = 3 v = 3 6 i = 3 6 v = 3 6 9 i = 3 6 9

4   Pass
x = 1; y = 1:100; [v,i] = nearVal(x,y); assert(all(v == 1 & i == 1))

v = 1 i = 1 v = 1 1 i = 1 1 v = 1 1 1 i = 1 1 1 v = 1 1 1 1 i = 1 1 1 1 v = 1 1 1 1 1 i = 1 1 1 1 1 v = 1 1 1 1 1 1 i = 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 i = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Column 31 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Column 31 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 32 1 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 32 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 33 1 1 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 33 1 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 34 1 1 1 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 34 1 1 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 35 1 1 1 1 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 35 1 1 1 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 36 1 1 1 1 1 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 36 1 1 1 1 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 37 1 1 1 1 1 1 1 i = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 37 1 1 1 1 1 1 1 v = Columns 1 through 30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 Columns 31 through 38 1 1 1 1 1 1 1 ...

5   Pass
x = (3:5).^2; y = 6:16; [v,i] = nearVal(x,y); assert(isequal(v,[9 9 9 9 9 9 9 16 16 16 16]) && isequal(i,[1 1 1 1 1 1 1 2 2 2 2]))

v = 9 i = 1 v = 9 9 i = 1 1 v = 9 9 9 i = 1 1 1 v = 9 9 9 9 i = 1 1 1 1 v = 9 9 9 9 9 i = 1 1 1 1 1 v = 9 9 9 9 9 9 i = 1 1 1 1 1 1 v = 9 9 9 9 9 9 9 i = 1 1 1 1 1 1 1 v = 9 9 9 9 9 9 9 16 i = 1 1 1 1 1 1 1 2 v = 9 9 9 9 9 9 9 16 16 i = 1 1 1 1 1 1 1 2 2 v = 9 9 9 9 9 9 9 16 16 16 i = 1 1 1 1 1 1 1 2 2 2 v = 9 9 9 9 9 9 9 16 16 16 16 i = 1 1 1 1 1 1 1 2 2 2 2

Suggested Problems

More from this Author56

Community Treasure Hunt

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

Start Hunting!