\textsf{\textbf{\color{orange}{def} binary\_search(arr, x):}} \\
\textsf{\quad \color{blue}{low} = 0} \\
\textsf{\quad \color{blue}{high} = len(arr) - 1} \\
\textsf{\quad \color{purple}{while} low <= high:} \\
\textsf{\quad \quad \color{blue}{mid} = (low + high) // 2} \\
\textsf{\quad \quad \color{purple}{if} arr[mid] == x:} \\
\textsf{\quad \quad \quad \color{orange}{return} mid} \\
\textsf{\quad \quad \color{purple}{elif} arr[mid] < x:} \\
\textsf{\quad \quad \quad \color{blue}{low} = mid + 1} \\
\textsf{\quad \quad \color{purple}{else}:} \\
\textsf{\quad \quad \quad \color{blue}{high} = mid - 1} \\
\textsf{\quad \color{orange}{return} -1}