public class BinarySearch $\{$

public static int binarySearch$($Object $[]$ data, Object key$)\{$

int lower $=0$;

int upper $=$ data.length $-1$;

int location;

while $($true$)\{$

location $=$ midpoint$($lower$,$ upper$)$;

if $($data$[$location$]==$ key$)\{$ return $($location$)$; $\}$

else if $($data$[$location$]<$ key$)\{$ lower $=$ location $+1$; $\}$ else $\{$ upper $=$ location $-1$; $\}$

$\}\}$

public static int midpoint$($int lower, int upper$)\{$ return $(($lower $+$ upper$)/2)$; $\}$

$\}$

A control flow graph representation.