Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Not Exponential, on Twitter
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
vertexcoloring
analysis
npcompleteness
greedy
log
exponent
mvcs
vertexcover
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
satisfiability
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Recent questions tagged recurrencerelations
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
asked
Jun 8, 2017
in
Dynamic Programming
by
Amrinder Arora
(
230
points)
recurrencerelations
+8
votes
4
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
asked
Feb 14, 2017
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
asymptoticanalysis
recurrencerelations
timecomplexity
+1
vote
1
answer
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
asked
Feb 8, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
recurrencerelations
asymptoticanalysis
timecomplexity
+2
votes
1
answer
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
asked
Dec 14, 2016
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
recurrencerelations
timecomplexity
asymptoticanalysis
+1
vote
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
asked
Dec 14, 2016
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
recurrencerelations
substitutionmethod
asymptoticanalysis
+1
vote
3
answers
Time Complexity  Recursive function  Two recursive calls, and double nested loop
asked
Oct 5, 2016
in
Asymptotic Analysis
by
Amal_Q
AlgoMeister
(
1,084
points)
timecomplexity
loops
asymptoticanalysis
recursive
recurrencerelations
0
votes
1
answer
Tree method or PMI?
asked
Sep 28, 2016
in
Divide & Conquer
by
taoran_xue
Active
(
276
points)
recurrencerelations
+1
vote
2
answers
MT for T(n) = 2T(n/2) + n^2 log n
asked
Sep 22, 2016
in
Asymptotic Analysis
by
Roc6212
AlgoMeister
(
748
points)
mastertheorem
recurrencerelations
+2
votes
3
answers
Can T(n) = 2T(n/2) + nlogn use master theorem?
asked
Sep 20, 2016
in
Divide & Conquer
by
TengLi
(
172
points)
mastertheorem
recurrencerelations
+3
votes
2
answers
Recurrence relation : T(n) = T(n/3) + 2 T(2n/3) + n
asked
Sep 15, 2016
in
Asymptotic Analysis
by
panrunyu
AlgoStar
(
400
points)
timecomplexity
recurrencerelations
To see more, click for the
full list of questions
or
popular tags
.
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...