1 v def func (x, y=[1]): 2 v if x <= 1: 3 return y y_2 = [y[integer] + y[integer+1] for integer in range (len(y)-1)] return function(x-1, [1] + y_2 + [1]) 4 5

C++ Programming: From Problem Analysis to Program Design
8th Edition
ISBN:9781337102087
Author:D. S. Malik
Publisher:D. S. Malik
Chapter15: Recursion
Section: Chapter Questions
Problem 8SA
icon
Related questions
Question

Given the following code snippet, find the following:
1) Recurrence relation of func (x,y) when x>0 and length of y is n. Express in the form below:
T(x,n) = T(?) + O(?)

For 2-3, consider worst-case scenario and initial value of y as [1]
2) Time complexity of func (x,y)
3) Space Complexity and Auxiliary Space Complexity of func (x,y)

1 v def func (x, y=[1]):
2 v
if x <= 1:
3
return y
y_2 = [y[integer] + y[integer+1] for integer in range (len(y)-1)]
return function(x-1, [1] + y_2 + [1])
4
5
Transcribed Image Text:1 v def func (x, y=[1]): 2 v if x <= 1: 3 return y y_2 = [y[integer] + y[integer+1] for integer in range (len(y)-1)] return function(x-1, [1] + y_2 + [1]) 4 5
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Declaring and Defining the Function
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning