Recursive Algorithm

Explain how recursive algorithm is converted into recurrence relation with example.

Questions by subindas

Showing Answers 1 - 3 of 3 Answers

riteshja88

  • Feb 27th, 2009
 

Say we want to represent the following recursion

int recurse(int a)
{
? ? ? return a+recurse(a-1);
}

x={x|x=a(a+1)/2} for all a

  Was this answer useful?  Yes

Give your answer:

If you think the above answer is not correct, Please select a reason and add your answer below.

 

Related Answered Questions

 

Related Open Questions