Consider the following code:
#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;
}
Which of the following is the base case for the above recursive code?
#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. if(n == 0)
B. return 0
C. return n + recursive_sum(n - 1)
D. if(n == 1)
Answer: Option A
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion