Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User taoran_xue
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 taoran_xue
2
answers
Topological Sort
commented
May 3, 2018
in
Backtracking/DFS/BFS
dfs
4
answers
Rectangles overlap
commented
Dec 6, 2016
in
Divide & Conquer
2
answers
The lower bound for the Traveling Salesman Problem
answered
Dec 5, 2016
in
Branch & Bound
branchandbound
3
answers
Finding non-leaf node of a tree with no large subtrees
answered
Dec 5, 2016
in
Backtracking/DFS/BFS
tree
graph
subtree
5
answers
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
commented
Oct 11, 2016
in
Asymptotic Analysis
exponent
log
small-oh
asymptotic-notation
1
answer
Heap removing and adding
commented
Oct 10, 2016
in
Graph Theory
3
answers
Time Complexity - Recursive function - Two recursive calls, and double nested loop
commented
Oct 5, 2016
in
Asymptotic Analysis
time-complexity
loops
asymptotic-analysis
recursive
recurrence-relations
1
answer
Tree method or PMI?
answer selected
Sep 28, 2016
in
Divide & Conquer
recurrence-relations
2
answers
MT for T(n) = 2T(n/2) + n^2 log n
answered
Sep 22, 2016
in
Asymptotic Analysis
master-theorem
recurrence-relations
3
answers
Can T(n) = 2T(n/2) + nlogn use master theorem?
answer edited
Sep 22, 2016
in
Divide & Conquer
master-theorem
recurrence-relations
2
answers
Order these time complexities from best (lowest) to worst (highest)
commented
Aug 31, 2016
in
Asymptotic Analysis
asymptotic-notation
log
exponent
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...