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
(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)
Recent activity by Roc6212
1
answer
Cook-Levin Theorem
answer selected
Dec 6, 2016
in
NP-Completeness
1
answer
Loop i through log n incremented by constant multiplication
answered
Dec 4, 2016
in
Asymptotic Analysis
loops
while-loop
logn
easy
1
answer
Prove that Vertex Cover is NP-hard problem
answered
Nov 22, 2016
in
NP-Completeness
np-completeness
reduction
vertex-cover
5
answers
Asymptotic Analysis - Triple Loop - k starts from j^2
commented
Nov 14, 2016
in
Asymptotic Analysis
asymptotic-notation
loops
analysis
5
answers
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
answered
Oct 17, 2016
in
Asymptotic Analysis
exponent
log
small-oh
asymptotic-notation
1
answer
Time complexity of recursive function - Single recursive call of size n/3 and n^2 loop
comment edited
Oct 4, 2016
in
Asymptotic Analysis
asymptotic-analysis
time-complexity
nested-loops
loops
2
answers
MT for T(n) = 2T(n/2) + n^2 log n
answer selected
Sep 27, 2016
in
Asymptotic Analysis
master-theorem
recurrence-relations
3
answers
Can T(n) = 2T(n/2) + nlogn use master theorem?
comment edited
Sep 22, 2016
in
Divide & Conquer
master-theorem
recurrence-relations
2
answers
Recurrence relation : T(n) = T(n/3) + 2 T(2n/3) + n
commented
Sep 21, 2016
in
Asymptotic Analysis
time-complexity
recurrence-relations
substitution-method
2
answers
Prove Ө(log 1 + log2 + log3 + log4 +... + logn) = Ө(n log n)
commented
Sep 20, 2016
in
Asymptotic Analysis
log
4
answers
For-While Nested Loops Time Complexity - Inner Loop increments by n^1/3
answer edited
Sep 15, 2016
in
Asymptotic Analysis
time-complexity
loops
2
answers
Order these time complexities from best (lowest) to worst (highest)
commented
Sep 14, 2016
in
Asymptotic Analysis
asymptotic-notation
log
exponent
2
answers
Time Complexity Analysis - Double Loop - Second increments by 0.01
commented
Aug 23, 2016
in
Asymptotic Analysis
time-complexity
asymptotic-notation
loops
analysis
5
answers
Magical eggs and tiny floors
answer edited
Aug 21, 2016
in
Dynamic Programming
dynamic-programming
eggs
floors
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...