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.
So you want this Equation to be developed in Java. If I am not wrong, T(1) will not be 4. Can you justify your statement.
Quote:
Originally Posted by Norm
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.
This is absolutely not how this works, and you're being extremely rude. Read the link in my signature on asking questions the smart way before posting again. Come back only when you have a specific technical question about a piece of code that you have written.Quote:
Originally Posted by inthu