Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Data Management Databases And Organizations

Authors: Richard T. Watson

2nd Edition

0471180742, 978-0471180746

More Books

Students also viewed these Databases questions