Consider the function below written in Python3: def foo(a, b=[1]): if a <= 1: return b b_new = [b[i] + b[i+1] for i in range(len (b)-1)] return foo(a-1, [1] + b_new + [1])
Consider the function below written in Python3: def foo(a, b=[1]): if a <= 1: return b b_new = [b[i] + b[i+1] for i in range(len (b)-1)] return foo(a-1, [1] + b_new + [1])
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
Python
Big-O Coding
will give high rating if answers are correct ty!
![Big-O Coding Exercise:
Given:
Consider the function below written in Python3:
def foo(a, b=[1]):
if a <= 1:
return b
b_new = [b[i] + b[i+1] for i in range(len(b)-1)]
return foo(a-1, [1] + b_new + [1])
Question:
The recurrence relation for foo(a, b) when a > 0 and assuming n is the length of b is:
T(a, n) = T
) +0
Notes when answering:
Note that when complexities or expressions are asked:
• Answer without the big-O.
Assume a, x, and y are very large.
Use 'log()' to add the logarithmic function (e.g. n log(n) is written as n* log(n )).
Use "(e)' to create exponents (e.g. 2" is written as 2^(n )).
• Use 'sqrt()' to create square roots (e.g. Vn is written as sqrt(n )).
• Remember that log,
log a/ log b.
a =](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa1f2c132-1439-42c7-b4cb-11c574c8a62f%2F891057c2-ce54-473d-9971-6f8b81c3db96%2Fygjxkfd_processed.png&w=3840&q=75)
Transcribed Image Text:Big-O Coding Exercise:
Given:
Consider the function below written in Python3:
def foo(a, b=[1]):
if a <= 1:
return b
b_new = [b[i] + b[i+1] for i in range(len(b)-1)]
return foo(a-1, [1] + b_new + [1])
Question:
The recurrence relation for foo(a, b) when a > 0 and assuming n is the length of b is:
T(a, n) = T
) +0
Notes when answering:
Note that when complexities or expressions are asked:
• Answer without the big-O.
Assume a, x, and y are very large.
Use 'log()' to add the logarithmic function (e.g. n log(n) is written as n* log(n )).
Use "(e)' to create exponents (e.g. 2" is written as 2^(n )).
• Use 'sqrt()' to create square roots (e.g. Vn is written as sqrt(n )).
• Remember that log,
log a/ log b.
a =
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education