CSE $205$: Object$-$Oriented Programming and Data Structures home $>$

Arrays with Methods

PARTICIPATION

ACTIVITY

$9\mathrm{.}7\mathrm{.}1$: Design a method that returns all values.

zyBooks catalog

Your task is to design a method

int$[]$ allMatches$($int$[]$ values, int size, int $a,$ int b$)$

that returns all values between a and $b$ inclusive in the partially filled array values. For example, if an array a contains $11,3,9,4,2,5,4,7,6,0,$ then the call allmatches $(a,8,3,7)$ should return an array containing $3,4,5,4,7.$ Note that the $6$ is not included because it is past the size of the partially filled array.

Arrange the code below in the right order. Not all lines are useful.

How to use this tool

Unused

$\{$

count$++$;

$\}$

for $($int $k=0$;$k$ size; $k++)$

$\{$

int $v=$ values $k$;

for $($int $v$ : v$$lues$)$

$\{$

if $)v$&&$v(b$

$\}$

int count $=0$;

if $[i]=v$;$9\mathrm{.}7-$