Thread: plz help me frdsssss

  1. #1
    Registered User
    Join Date
    Dec 2011

    plz help me frdsssss

    help to Data Structures & Algorithms plzzzzzzzzzz in java
    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.

  2. #2
    Registered User
    Join Date
    Aug 2003
    This is the C# forum....

  3. #3
    and the hat of int overfl Salem's Avatar
    Join Date
    Aug 2001
    The edge of the known universe
    Wrong forum, and homework begging.
    If we had a Java forum, I would move it, but since we don't - closed.
    If you dance barefoot on the broken glass of undefined behaviour, you've got to expect the occasional cut.
    If at first you don't succeed, try writing your phone number on the exam paper.

Popular pages Recent additions subscribe to a feed