I was solving recurrence relations. The first recurrence relation was $T(n)=2T(n/2)+n$ The solution of this one can be found by Master Theorem or the recurrence tree method. The recurrence tree
Master theorem (analysis of algorithms) - Wikipedia
Iterative Method - Computer Geek
Recursion tree method
Recurrence Relation For Complexity Analysis of Algorithms, PDF, Time Complexity
How to solve T(n)=2T(n/2)+log n with the recurrence tree method - Quora
Lecture 20: Recursion Trees and the Master Method
SOLVED: 1. (1.5pts) Argue the solution to the recurrence T(n) = T(n/2) + O(1) is O(log n). Use the substitution method to verify your answer. 2. (1.5pts) Argue the solution to the
PPT - CS 3343: Analysis of Algorithms PowerPoint Presentation, free download - ID:9549834
DAA Recursion Tree Method - javatpoint
algorithm - Recurrence: T(n/4) + T(n/2) + n^2 with tree methods - Stack Overflow
Answered: 1. Argue the solution to the recurrence…
How to solve T(n)=2T(n/2)+log n with the recurrence tree method - Quora
Solving Recurrence relation- T(n)=2T(n/2)+1
8/2/20151 Analysis of Algorithms Lecture: Solving recurrence by recursion-tree method. - ppt download
Computer Science: Solving T(n) = 2T(n/2) + log n with the recurrence tree method
