What will be the recurrence relation of the following code?
Int sum(int n)
{
If(n==1)
return 1;
else
return n+sum(n-1);
}
Int sum(int n)
{
If(n==1)
return 1;
else
return n+sum(n-1);
}A. T(n) = T(n/2) + n
B. T(n) = T(n-1) + n
C. T(n) = T(n-1) + O(1)
D. T(n) = T(n/2) + O(1)
Answer: Option C
This Question Belongs to Data Structure >> Miscellaneous On Data Structures
Join The Discussion