GATE 2002: THE SOLUTION OF RECURRENCE EQUATION

0

GATE 2002:
THE SOLUTION OF RECURRENCE EQUATION
T(2^K)=3T(2^K-1)+1,T(1)=1

Ravi Garg edited question
    0
    Madhav Purohit (anonymous)

    O(n^log3 base 2)

    Madhav Purohit answered
      0
      Satyajit Bhadange (anonymous)

      is it (3^(2^k))….method….replace 2^k with n….soln o new eqn is 3^n….

      Satyajit Bhadange answered
        Add image to editor add image from link

        Question stats

        • Active
        • Views227 times
        • Answers2 answers
        • Followers1 follower
        Question and answer is powered by AnsPress