adplus-dvertising
frame-decoration

Question

How many times is the function recursive_sum() called when the following code is executed?
#include<stdio.h>
int recursive_sum(int n)
{
      if(n == 0)
        return 0;
      return n + recursive_sum(n - 1);
}
int main()
{
     int n = 5;
     int ans = recursive_sum(n);
     printf("%d",ans);
     return 0;
}

a.

4

b.

5

c.

6

d.

7

Answer: (c).6

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. How many times is the function recursive_sum() called when the following code is executed?

Similar Questions

Discover Related MCQs

Q. Which of the following methods can be used to find the sum of digits of a number?

Q. What can be the maximum sum of digits for a 4 digit number?

Q. What can be the minimum sum of digits for a 4 digit number?

Q. Which of the following is the binary representation of 100?

Q. What is the time complexity of the recursive implementation used to convert a decimal number to its binary equivalent?

Q. What is the space complexity of the recursive implementation used to convert a decimal number to its binary equivalent?

Q. What is the time complexity of the above iterative implementation used to find the length of a linked list?

Q. Which of the following can be the base case for the recursive implementation used to find the length of linked list?

Q. Which of the following can be the base case for the recursive implementation used to find the length of a string?

Q. What is the time complexity of the above recursive implementation used to find the length of the string?

Q. Which of the following methods can be used to find the largest and smallest element in an array?

Q. What is the time complexity of the above iterative implementation used to find the largest and smallest element in an array?

Q. What is the time complexity of the above recursive implementation used to find the largest and the smallest element in an array?

Q. Which of the following methods can be used to find the largest and smallest number in a linked list?

Q. What is the time complexity of the above iterative code used to find the smallest and largest element in a linked list?

Q. What is the time complexity of the recursive implementation used to find the largest and smallest element in a linked list?

Q. Which of the following techniques can be used to search an element in an unsorted array?

Q. Consider the array {1,1,1,1,1}:
Which of the following techniques can be used to search an element in the above array?

Q. What is the time complexity of the above recursive implementation of linear search?

Q. Which of the following methods can be used to search an element in a linked list?