The following algorithm represents which search algorithm:$$

Parameters inital$\_$value $,$ end$\_$value

Step $1$ : Find the middle element of array. using $,$

middle $=$ initial$\_$value $+$ end$\_$value $/2$ ;

Step $2$ : If middle $=$ element, return $$element found$$ and index.

Step $3$ : if middle $>$ element, call the function with end$\_$value $=$ middle $-1.$

Step $4$ : if middle $<$ element, call the function with start$\_$value $=$ middle $+1.$

Step $5$ : exit.