Homework Help is Here – Start Your Trial Now!
Engineering
Computer Science
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
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
See similar textbooks
icon
Related questions
Question

Solve the questions on recursive function;

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?
Transcribed Image Text: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?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
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
SEE MORE TEXTBOOKS