Binary Search Algorithm $(12)$

Input: Key, List

Initialisation: LIlarr$0,$HIlarr SizeOf$($List$)-1$

Repeat steps $1$ and $2$ until $LI>HI$

Midlarr$\frac{LI+HI}{2}$

If List$[$Mid$]=$ Key then

Return Mid

$/$ success

Else If Key $$ List$[$Mid$]$ then

HIlarr Mid $-1$

Else

LIlarrMid$+1$

Return $-1$

$//$ failure

$(((($Transfer these algorithm to java cobe.$))))$