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)
Answers by Roc6212
+2
votes
Loop i through log n incremented by constant multiplication
answered
Dec 4, 2016
in
Asymptotic Analysis
loops
while-loop
logn
easy
+3
votes
Prove that Vertex Cover is NP-hard problem
answered
Nov 22, 2016
in
NP-Completeness
np-completeness
reduction
vertex-cover
–1
vote
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
vote
For-While Nested Loops Time Complexity - Inner Loop increments by n^1/3
answered
Sep 15, 2016
in
Asymptotic Analysis
time-complexity
loops
0
votes
Time Complexity Analysis - Double Loop - Second increments by 0.01
answered
Aug 21, 2016
in
Asymptotic Analysis
time-complexity
asymptotic-notation
loops
analysis
0
votes
Magical eggs and tiny floors
answered
Aug 9, 2016
in
Dynamic Programming
dynamic-programming
eggs
floors
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc