human
Binary Search | It returns location of x in given array arr if present , else returns - 1.
Check if x is present at mid.
If x is greater , ignore left half.
If x is smaller , ignore right half.
If we reach here , then the element was not present.
Driver Code"
Solution in Python:

Write me a code to binary Search and the other steps required?
assistant
#Here is code to binary Search and the other steps required.
 def binarySearch ( arr , l , r , x ) :
	while l <= r :
		mid = l + ( r - l ) // 2 ;
		if arr [ mid ] == x :
			return mid
		elif arr [ mid ] < x :
			l = mid + 1
		else :
			r = mid - 1
	return - 1
arr = [ 2 , 3 , 4 , 10 , 40 ]
x = 10
result = binarySearch ( arr , 0 , len ( arr ) - 1 , x )
if result != - 1 :
	print ( " Element ▁ is ▁ present ▁ at ▁ index ▁ % ▁ d " % result )
else :
	print ( " Element ▁ is ▁ not ▁ present ▁ in ▁ array " )