Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Roc6212
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
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)
Questions by Roc6212
+2
votes
1
answer
Cook-Levin Theorem
asked
Dec 6, 2016
in
NP-Completeness
+1
vote
1
answer
Time complexity of recursive function - Single recursive call of size n/3 and n^2 loop
asked
Oct 3, 2016
in
Asymptotic Analysis
asymptotic-analysis
time-complexity
nested-loops
loops
+1
vote
2
answers
MT for T(n) = 2T(n/2) + n^2 log n
asked
Sep 22, 2016
in
Asymptotic Analysis
master-theorem
recurrence-relations
0
votes
2
answers
Prove Ө(log 1 + log2 + log3 + log4 +... + logn) = Ө(n log n)
asked
Sep 15, 2016
in
Asymptotic Analysis
log
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc