Question $1$

$1pts$

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

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

int begin $=0,$ end $=$ size $-1,$ look $=0$;

while$($begin $$ end$)\{$

look $=($begin $+$ end