given the recurrence relationfind T625 Tn7Tn510n for n1 T11

given the recurrence relation,find T(625)

{

T(n)=7T(n/5)+10n for n>1

T(1)=1

}

Solution

Please follow the data and description :

Recursion :

This is the process of repeating the loop or the piece of code till the value of the integer gets satisfied. This is generally used to calculate the values of a given number without the use of a loop or a iteration.

For the given condition this values has been calculated for the every recursion calls.

T(625)=7T(125)+10n for n>1 = 40551 + 6250 = 46801

T(125)=7T(25)+10n for n>1 = 4543 + 1250 = 5793

T(25)=7T(5)+10n for n>1 = 399 + 250 = 649

T(5)=7T(1)+10n for n>1 = 57

So the result value after recursion is 46801.

Hope this is helpful.