Python Big-O Coding pls answer only if u know Big-O!! Note for correct answers: First code (left side): - T(n-1) is NOT the answer.
Python Big-O Coding pls answer only if u know Big-O!! Note for correct answers: First code (left side): - T(n-1) is NOT the answer.
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
pls answer only if u know Big-O!!
Note for correct answers:
First code (left side):
- T(n-1) is NOT the answer.
Second code (right side)
- T (n/2) and T(x, y/2) is NOT the answer.
- O(n), O(1), O(b^2), O(c), O(a) are NOT the worst auxiliary cases.
![Consider the function below written in Python3:
Consider the function below written in Python3:
def foo(a, b=[1]):
def bar(x, y):
if a <= 1:
if y > 0:
return b
if (y % 2):
b_new = [b[i] + b[i+1] for i in range(len(b)-1)]
return bar(x, y >> 1) + bar(x, y >> 1) + x
return foo(a-1, [1] + b_new + [1])
return bar(x, y >> 1) + bar(x, y >> 1)
else:
return 0
The recurrence relation for foo(a, b) when a > 0 and assuming n is the length of b is:
а,
The recurrence relation for bar(x, y) when x, y > 0 is:
T(а, п) - Т(
+o(n
T(x, y) = 2
+0(1
T
What is the worst-case auxiliary space complexity of bar(, y)?
(Follow/use the same notes above)
Answer:](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fa1f2c132-1439-42c7-b4cb-11c574c8a62f%2Fe82583a5-cd56-415c-96c1-66a22485331d%2Fnvlk05d_processed.png&w=3840&q=75)
Transcribed Image Text:Consider the function below written in Python3:
Consider the function below written in Python3:
def foo(a, b=[1]):
def bar(x, y):
if a <= 1:
if y > 0:
return b
if (y % 2):
b_new = [b[i] + b[i+1] for i in range(len(b)-1)]
return bar(x, y >> 1) + bar(x, y >> 1) + x
return foo(a-1, [1] + b_new + [1])
return bar(x, y >> 1) + bar(x, y >> 1)
else:
return 0
The recurrence relation for foo(a, b) when a > 0 and assuming n is the length of b is:
а,
The recurrence relation for bar(x, y) when x, y > 0 is:
T(а, п) - Т(
+o(n
T(x, y) = 2
+0(1
T
What is the worst-case auxiliary space complexity of bar(, y)?
(Follow/use the same notes above)
Answer:
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 3 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