Question: which has a smaller Big O time complexity? def atoiR 1 ( string , num ) : if len ( string ) = = 0

which has a smaller Big O time complexity? def atoiR1(string, num):
if len(string)==0:
return 0
if len(string)==1:
return int(string)+(num*10)
num = int(string[0:1])+(num *10)
return atoiR1(string[1:], num)
def atoiR2(string):
if len(string)==0:
return 0
if len(string)==1:
return int(string)
return atoiR2(string[0:-1])*10+ int(string[-1])

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!