Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User oxley
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
Divide & Conquer
(18)
Greedy Algorithms
(10)
Dynamic Programming
(19)
Backtracking/DFS/BFS
(2)
Branch & Bound
(6)
Graph Theory
(11)
NP-Completeness
(8)
Artificial Intelligence
(28)
Randomized Algorithms
(1)
Answers by oxley
+1
vote
Solving this recurrence relation: T(n) = 2 T(n/2) + f(n)
answered
Sep 29, 2019
in
Divide & Conquer
recurrence-relations
+2
votes
Solve this recurrence relation: T(n) = T(n/3) + T(n/5) + T(n/6) + n
answered
Sep 22, 2019
in
Divide & Conquer
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc