2) Consider the following recursive function, for which again, we can assume the parameters to be non-negative integers. This function computes the combinations of k out of n objects using Pascal's triangle formula. int combinations (int k, int n) { if (k>n) return 0; else if (n == k || k == 0) return 1; else return combinations(k-1, n-1) + combinations(k, n-1); How many nodes does the runtime stack contain at the most for the function call above, not including the main? a) Draw the recursion tree for computing combinations (4, 7). b) c) How many repeated function calls can you observe in the tree? Give an example. Is this an indication that the function is inefficient?
2) Consider the following recursive function, for which again, we can assume the parameters to be non-negative integers. This function computes the combinations of k out of n objects using Pascal's triangle formula. int combinations (int k, int n) { if (k>n) return 0; else if (n == k || k == 0) return 1; else return combinations(k-1, n-1) + combinations(k, n-1); How many nodes does the runtime stack contain at the most for the function call above, not including the main? a) Draw the recursion tree for computing combinations (4, 7). b) c) How many repeated function calls can you observe in the tree? Give an example. Is this an indication that the function is inefficient?
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
Related questions
Question
Solve the questions on recursive function;
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps
Recommended textbooks for you
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:
9781133187844
Author:
Bronson, Gary J.
Publisher:
Course Technology Ptr
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning
LINUX+ AND LPIC-1 GDE.TO LINUX CERTIF.
Computer Science
ISBN:
9781337569798
Author:
ECKERT
Publisher:
CENGAGE L