Results 1 to 3 of 3

Math Help - Recurrence problem

  1. #1
    Newbie
    Joined
    Nov 2007
    Posts
    22

    Recurrence problem

    Hello!
    I have been asked to solve the following recurrence problem (in order to see the complexity of an algorithm) :

    T(n)= T(n/2 + sqrt(n)) + n

    Do you have any idea of solving it ?

    Thank you very much!
    Follow Math Help Forum on Facebook and Google+

  2. #2
    Newbie Bill Zimmerly's Avatar
    Joined
    Nov 2009
    From
    Hillsboro, Missouri, USA
    Posts
    24

    Wink

    Quote Originally Posted by inzaghina View Post
    Hello!
    I have been asked to solve the following recurrence problem (in order to see the complexity of an algorithm) :

    T(n)= T(n/2 + sqrt(n)) + n

    Do you have any idea of solving it ?

    Thank you very much!
    It seems to me that n=0 will work.
    Follow Math Help Forum on Facebook and Google+

  3. #3
    Newbie
    Joined
    Nov 2007
    Posts
    22
    yes..
    and then.. nothing will work
    Follow Math Help Forum on Facebook and Google+

Similar Math Help Forum Discussions

  1. Recurrence relation problem
    Posted in the Discrete Math Forum
    Replies: 1
    Last Post: November 8th 2011, 06:45 AM
  2. Recurrence Relation Problem...
    Posted in the Discrete Math Forum
    Replies: 5
    Last Post: October 10th 2010, 02:41 PM
  3. recurrence problem...
    Posted in the Pre-Calculus Forum
    Replies: 2
    Last Post: August 20th 2009, 05:43 PM
  4. Please Help! Recurrence Problem!
    Posted in the Algebra Forum
    Replies: 1
    Last Post: February 25th 2009, 01:44 PM
  5. Recurrence Problem
    Posted in the Discrete Math Forum
    Replies: 3
    Last Post: March 15th 2006, 05:10 AM

Search Tags


/mathhelpforum @mathhelpforum