Like Tree3Likes
  • 3 Post By Salem

plz help me frdsssss

This is a discussion on plz help me frdsssss within the C# Programming forums, part of the General Programming Boards category; help to Data Structures & Algorithms plzzzzzzzzzz in java Consider the following recurrence: T(1) = 4 T(n) = 2T(n/2) + ...

  1. #1
    Registered User
    Join Date
    Dec 2011
    Posts
    7

    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
    Posts
    1,208
    This is the C# forum....

  3. #3
    and the hat of wrongness Salem's Avatar
    Join Date
    Aug 2001
    Location
    The edge of the known universe
    Posts
    32,668
    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.
    I support http://www.ukip.org/ as the first necessary step to a free Europe.

Popular pages Recent additions subscribe to a feed

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21