Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User shijie
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 shijie
3
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
answer edited
May 9, 2017
in
Divide & Conquer
asymptotic-analysis
recurrence-relations
time-complexity
substitution-method
2
answers
Given jobs, resources and cost matrix, what assignment minimizes the overall cost?
asked
May 8, 2017
in
Branch & Bound
job-assignment
2
answers
What's the time complexity for solving Sudoku with backtrack method?
edited
Apr 29, 2017
in
NP-Completeness
time-complexity
backtracking
sudoku
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
answer selected
Mar 28, 2017
in
Asymptotic Analysis
4
answers
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
asked
Feb 8, 2017
in
Asymptotic Analysis
recurrence-relations
asymptotic-analysis
time-complexity
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc