static boolean search$($int$[]$ a$,$ int x$)\{$

int n $=$ a$.$length;

for $($int h $=$ n; h $>0$; h $/=2)\{$

for $($int i $=$ n$-1$; i $>=0$; i$-=$ h$)\{$

if $($a$[$i$]==$ x$)\{$

return true;

$\}$

$\}$

$\}$

return false;

$\}$ Argue that the worst case running time of search is directly proportional to the number

of times the if $($a$[$i$]==$ x$)$ test is checked in the worst case