Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User sdalaee
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 sdalaee
+1
vote
N-th power of complex number z = x + iy in O(log n) time
answered
Jun 30, 2020
in
Divide & Conquer
logn
+1
vote
Solve this recurrence relation: T(n) = 3 T(n/4) + O(n^0.75)
answered
Jun 30, 2020
in
Divide & Conquer
recurrence-relations
asymptotic-analysis
substitution-method
master-theorem
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc