human
Exponential Search | Returns the position of first occurrence of x in array.
IF x is present at first location itself.
Find range for binary search j by repeated doubling.
Call binary search for the found range.
A recurssive binary search function returns location of x in given array arr [ l . . r ] is present , otherwise - 1.
If the element is present at the middle itself.
If the element is smaller than mid , then it can only be present in the left subarray.
Else he element can only be present in the right.
We reach here if the element is not present.
Driver Code"
Solution in Python:

=====
Give me a code to exponential Search and the other steps required?
assistant
#Here is code to exponential Search and the other steps required.
 def exponentialSearch ( arr , n , x ) :
	if arr [ 0 ] == x :
		return 0
	i = 1
	while i < n and arr [ i ] <= x :
		i = i * 2
	return binarySearch ( arr , i / 2 , min ( i , n - 1 ) , x )
def binarySearch ( arr , l , r , x ) :
	if r >= l :
		mid = l + ( r - l ) / 2
		if arr [ mid ] == x :
			return mid
		if arr [ mid ] > x :
			return binarySearch ( arr , l , mid - 1 , x )
		return binarySearch ( arr , mid + 1 , r , x )
	return - 1
arr = [ 2 , 3 , 4 , 10 , 40 ]
n = len ( arr )
x = 10
result = exponentialSearch ( arr , n , x )
if result == - 1 :
	print " Element ▁ not ▁ found ▁ in ▁ thye ▁ array "
else :
	print " Element ▁ is ▁ present ▁ at ▁ index ▁ % d " % ( result )