A much easier method in this case would be to guess it and then prove its correctness using induction.

The Gateway to Computer Science Excellence

0 votes

0

The term n in recurrence relation represent the cost at the top level of recursion and the rest 3 term represent the cost incurred by subproblem of size n/2,n/4,n/8

- All categories
- General Aptitude 1.9k
- Engineering Mathematics 7.5k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.2k
- Non GATE 1.4k
- Others 1.4k
- Admissions 595
- Exam Queries 573
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 18

50,737 questions

57,370 answers

198,506 comments

105,272 users