Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Mingyu Liang
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 Mingyu Liang
+3
votes
Given f(n) = o(g(n)), show that it is not necessary that log (f(n)) = o(log (g(n)))
answered
Sep 15, 2016
in
Asymptotic Analysis
asymptotic-notation
small-oh
log
+2
votes
Order these time complexities from best (lowest) to worst (highest)
answered
Sep 6, 2016
in
Asymptotic Analysis
asymptotic-notation
log
exponent
+1
vote
Magical eggs and tiny floors
answered
Aug 9, 2016
in
Dynamic Programming
dynamic-programming
eggs
floors
+7
votes
Asymptotic Analysis - Triple Loop - k starts from j^2
answered
Aug 7, 2016
in
Asymptotic Analysis
asymptotic-notation
loops
analysis
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc