Consider the following recurrence:
T(1) = 4
T(n) = 2T(n/2) + 5n + 3
• Evaluate the value of T(n) for n = 2, 4, 8, 16, 32
• Solve the above recurrence exactly by finding a closed form expression
for it using recursion technique.:confused:
Printable View
Consider the following recurrence:
T(1) = 4
T(n) = 2T(n/2) + 5n + 3
• Evaluate the value of T(n) for n = 2, 4, 8, 16, 32
• Solve the above recurrence exactly by finding a closed form expression
for it using recursion technique.:confused:
Is this a programming question?
Do you have some code you are having a problem with?
Please post the code and ask your questions or describe your problem.
yes i want in java code ..
bcz i dont know.
i have this question to do as work
i cant understand i they ask me
so i need u help plzz
Do you know what recursion is?
Have you looked at some of the sample programs that use recursion?
Search here on the forum or use Google to get some samples.