Q$1$ Runtime

$2$ Points

Grading comment:

$//$ This method returns whether or not a pair of numbers,

$//$ num$1$ and num$2,$ are between $1-$m and $1-$n$,$ respectively

boolean findPair$($int num$1,$ int num$2,$ int m$,$ int n$)\{$

for $($int i $=1$; i $<=$ m; i$++)\{$

if $($num$1==$ i$)\{$

for $($int j $=1$; j $<=$ n; j$++)\{$

if $($num$2==$ j$)\{$

return true;

$\}$

$\}$

$\}$

$\}$

return false;

$\}$

Question $1\mathrm{.}1$ Worst$-$case runtime

Q$1\mathrm{.}1$ Worst$-$case runtime

$1$ Point

Grading comment:

What is the worst case runtime of findPair?

Choice $1$ of $5$:O$($m$+$n$)$

Choice $2$ of $5$:O$($m$*$n$)$

Choice $3$ of $5$:O$($m$/$n$)$

Choice $4$ of $5$:O$($m$)$

Choice $5$ of $5$:O$($n$)$