What is the Big O time complexity of the worst case scenario for the following code designed to search for a string in an array of strings and return its integer index within the array?

int search$($string arr$[],$ int size, string value$)\{$

for$($int i $=0$; i $<$ size; i$++)\{$

if$($arr$[$i$]==$ value$)$

return i;

$\}$

return $-1$;

$\}$