human
Binary Search | Returns index of x in arr if present , else - 1.
If element is present at the middle itself.
If element is smaller than mid , then it can only be present in left subarray.
Else the element can only be present in right subarray.
Element is not present in the array.
Driver Code"
Solution in Python:
assistant
#Here is code to binary Search and the other steps required.
 def binarySearch ( arr , l , r , x ) :
	if r >= l :
		mid = l + ( r - l ) // 2
		if arr [ mid ] == x :
			return mid
		elif arr [ mid ] > x :
			return binarySearch ( arr , l , mid - 1 , x )
		else :
			return binarySearch ( arr , mid + 1 , r , x )
	else :
		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 " )