human
Can you provide a code to recursive Implementation of atoi ( ) and the other steps required given the following:
Recursive Implementation of atoi ( ) | Recursive function to compute atoi ( ).
base case , we 've hit the end of the string,  we just return the last value.
If more than 1 digits , recur for ( n - 1 ) , multiplu result with 10 and add last digit.
Driver Code"
How can the above be solved in Python?
assistant
#Here is code to recursive Implementation of atoi ( ) and the other steps required.
 def myAtoiRecursive ( string , num ) :
	if len ( string ) == 1 :
		return int ( string ) + ( num * 10 )
	num = int ( string [ 0 : 1 ] ) + ( num * 10 )
	return myAtoiRecursive ( string [ 1 : ] , num )
string = "112"
print ( myAtoiRecursive ( string , 0 ) )