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.
Welcome to the Java Programming Forums
The professional, friendly Java community. 21,500 members and growing!
The Java Programming Forums are a community of Java programmers from all around the World. Our members have a wide range of skills and they all have one thing in common: A passion to learn and code Java. We invite beginner Java programmers right through to Java professionals to post here and share your knowledge. Become a part of the community, help others, expand your knowledge of Java and enjoy talking with like minded people. Registration is quick and best of all free. We look forward to meeting you.
>> REGISTER NOW TO START POSTING
Members have full access to the forums. Advertisements are removed for registered users.
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.
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.
inthu (December 8th, 2011)
inthu (December 12th, 2011)
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.
How to Ask Questions the Smart Way
Static Void Games - GameDev tutorials, free Java and JavaScript hosting!
Static Void Games forum - Come say hello!