Examine the code snippet shown below.

int search$($vector v$,$ int value$)$

$\{$

int i $=0$;

int j $=$ v$.$size$()$;

while $($i $<$ j$)$

$\{$

j$--$;

if $($v$[$j$]==$ value$)\{$ return j; $\}$

if $($v$[$i$]==$ value$)\{$ return i; $\}$

i$++$;

$\}$

return $-1$;

$\}$

What is the execution time for this search function for a vector of size n$?$