Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Hao Wen
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
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 Hao Wen
0
votes
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
answered
Feb 8, 2017
in
Asymptotic Analysis
recurrence-relations
asymptotic-analysis
time-complexity
+1
vote
In Quickselect, T(n)<=T(n/5)+T(7n/10)+cn, prove that T(n) = O(n)
answered
Feb 7, 2017
in
Divide & Conquer
+1
vote
The executive time of program in eclipse seems to be randomly when the times are not very large
answered
Jan 24, 2017
in
Asymptotic Analysis
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc