HomeworkLib
Question

In C: 10. Draw the recursion tree to find out the value of f(5) int f(int...

In C:

10. Draw the recursion tree to find out the value of f(5) int f(int n)
{
int ans;
int i;
if(n<3)
return n;
ans = f(n/2);
for(i=0; i<n; i++)
ans += f(i);
return ans;
}

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Here I attach the answer:

In the function call for f(5). loop with variable 'i' will iterate for 5 time through 0 to 4 . In the end ans will be computed and returns 18.

0 0
Add a comment
Know the answer?
Add Answer to:
In C: 10. Draw the recursion tree to find out the value of f(5) int f(int...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Recursion Tree Goal: Predict the output of a recursive method call using a recursion tree. Draw...

    Recursion Tree Goal: Predict the output of a recursive method call using a recursion tree. Draw the recursion tree of the following source code, showing all method calls and outputs: public class Main { public static void main(String[] args) { f(3, 4); } public static void f(int x, int y) { if(x + y > 1) { f(x - 2, y - 1); System.out.print(x + " "); f(y, x - 2); System.out.print(2 * x + y + " "); }...

  • Here is the recursion tree for the above: I need to know the formula that counts...

    Here is the recursion tree for the above: I need to know the formula that counts the nodes in that recursion tree. An example: the recursion tree for a selection sort with an array of 4 in the worst case scenario looks like this: That is the type of solution I am looking for. Please determine the formula to count the number of nodes in the recursion tree for the insertion sort with an array size of 5 (n=5) where...

  • Convert the following to mips assembly: int recursion (int N) { int i, j, k; if...

    Convert the following to mips assembly: int recursion (int N) { int i, j, k; if (N greater than 9) {     print "End recursion\n";     return N; } print "Recursion in "; print N; print ":"; for (k=0; k less than N; k=k+1)     print "x"; print "\n"; i = N + 7; j = N + 1; k = 13 - i; j = recursion (j); j = j - k; j = j + i; print "Recursion...

  • Fix this C++ below so does not use any loops at all. Use recursion instead. here...

    Fix this C++ below so does not use any loops at all. Use recursion instead. here is some guides given. Create a directory to hold assignment 3. Copy files hailstone.cpp, Makefile and dotestassignment 2 to the assignment 3 directory. Edit the comments at the top of hailstone.cppto say that this is assignment 3. You should be able to keep the same contracts, 'next' function and 'main' function from assignment 2, unless they contained errors that needed to be fixed. If...

  • 1.Fix any tree T on 10 vertices. Draw the recursion tree of the algorithm Find-size-node when...

    1.Fix any tree T on 10 vertices. Draw the recursion tree of the algorithm Find-size-node when run on the input T with a being the root of T. Can you use this to give a bound on the running time of T? 2. Consider the following problem. Check-BST • Input: A binary tree T • Output: 1 if T is a binary search tree, and 0 otherwise. Give an efficient algorithm for this problem. 3.Give a recursive algorithm for the...

  • LANGUAGE IS C++ Lab Ch14 Recursion In this lab, you are provided with startup code which...

    LANGUAGE IS C++ Lab Ch14 Recursion In this lab, you are provided with startup code which has six working functions that use looping (for, while, or do loops) to repeat the same set of statements multiple times. You will create six equivalent functions that use recursion instead of looping. Although looping and recursion can be interchanged, for many problems, recursion is easier and more elegant. Like loops, recursion must ALWAYS contain a condition; otherwise, you have an infinite recursion (or...

  • draw the first 3 levels of a recursion tree for the recurrence T(n) = 4T(n/2) +...

    draw the first 3 levels of a recursion tree for the recurrence T(n) = 4T(n/2) + n. How many levels does it have? Find a summation for the running time and solve for it.

  • Question 1 (4 points) Answer the following questions. a. Draw a recursion tree for the recurrence...

    Question 1 (4 points) Answer the following questions. a. Draw a recursion tree for the recurrence T(n) T(an) + T(1- a)n cn, where 0 α < 1 and c > 0 are constants. Draw the nodes at three levels, i.e., level 0, 1, and 2 (root node is level 0).

  • C++ Recursion Practice! 1)Multiplication #include <iostream.h> int Multiply(int M, int N) //Performs multiplication using the +...

    C++ Recursion Practice! 1)Multiplication #include <iostream.h> int Multiply(int M, int N) //Performs multiplication using the + operator. //Pre : M and N are defined and N > 0. //Post: Returns M x N { int Prod; if (N == 1)     Prod = M;                       //base case else     Prod = M + Multiply(M, N - 1); //recursive step return Prod; } 2) Reverse #include <iostream.h> void Reverse(int N) //Displays string of length N in the reverse order //Pre : N...

  • (Weight: 3090) Use substitution, summation, or recursion tree method to solve the f ollowi recurrence relations....

    (Weight: 3090) Use substitution, summation, or recursion tree method to solve the f ollowi recurrence relations. (a) T(n) = 2T(n/2) + nign (b) T(n) 2T(n-1)+5" 7(0) = 8

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT