Awesome q2a theme
0 votes
15 views
How to solve recurrence relation $T(n)=O(n)+2T(4n/5)$

Thank-you
in Algorithms by (21 points)
edited by | 15 views

1 Answer

+2 votes
Best answer

Here clearly we can apply Master’s theorem

by (577 points)
selected by
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Oct 2019
  1. GAITONDE

    410 Points

  2. Satbir

    317 Points

  3. Rudr Pawan

    163 Points

  4. srestha

    136 Points

  5. Mk Utkarsh

    127 Points

  6. Debapaul

    94 Points

  7. chandrikabhuyan8

    83 Points

  8. Shaik Masthan

    79 Points

  9. Verma Ashish

    77 Points

  10. !KARAN

    74 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 450.
1,680 questions
1,089 answers
4,559 comments
89,591 users