GATE CSE
First time here? Checkout the FAQ!
x
+2 votes
115 views

How to solve this equation by the recursion tree method?

asked in Algorithms by (417 points)  
edited by | 115 views

3 Answers

0 votes

Not all question are solved by reccurence tree method. Here Master Theorem is efficent for us.

But,You can think of your recurrence as being a tree. The top level takes  sqrt(n) steps. At the next level, you have five different calls, and each one takes sqrt(n/5 ) steps. The next level has 9 different calls, and so on, until you reach your base case.
The total work done is the sum of the work at each level.

 

answered by Junior (549 points)  
0 votes
According to master's theorem we are getting ans as o(n)
answered by Junior (897 points)  
0 votes
Ans will be O(n).
answered by (35 points)  

Related questions

0 votes
1 answer
2
asked in Databases by firki lama Junior (839 points)   | 67 views
+5 votes
0 answers
3
asked in Databases by Akanksha Kesarwani Active (1.3k points)   | 103 views


Top Users Mar 2017
  1. rude

    4018 Points

  2. sh!va

    2994 Points

  3. Rahul Jain25

    2804 Points

  4. Kapil

    2608 Points

  5. Debashish Deka

    2104 Points

  6. 2018

    1414 Points

  7. Vignesh Sekar

    1336 Points

  8. Bikram

    1218 Points

  9. Akriti sood

    1186 Points

  10. Sanjay Sharma

    1016 Points

Monthly Topper: Rs. 500 gift card

21,446 questions
26,759 answers
60,943 comments
22,955 users