Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
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)
Most popular tags
recurrence-relations
time-complexity
asymptotic-analysis
loops
graph
asymptotic-notation
dynamic-programming
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
analysis
mdp
log
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
exam
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
coins
reduction
dfs
prime-numbers
sqrt
count
easy
sorted-lists
logn
example
recursive
gcd
independent-set
unsolvable
pcp
counter-example
not-master-theorem
modulus
algebra
most-likely-estimate
reinforcement-learning
direct-evaluation
meu
articulation-point
hotel-room
small-omega
limit-method
mle
graph-search
while-loop
greedy-suboptimal
job-assignment
maximize-value
gold
constraint-satisfaction-problem
8-puzzle
task-environments
min-max
peak
randomized
satisfiability
random-graph-generation
proxy
network
sudoku
branchandbound
d&c
degree-constrained
spanning-tree
vertex-cover
branch
subtree
series
pmi
bound
contradiction
math
backtracking
tree
minimize
floors
Recent questions tagged recurrence-relations
0
votes
4
answers
Solve this recurrence relation: T(n) = T(n/2) + n/log n
asked
Dec 9, 2023
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
time-complexity
0
votes
9
answers
Solve this recurrence using master theorem: T(n) = 2 T(n/2) + n^0.75
asked
Sep 10, 2023
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
master-theorem
time-complexity
asymptotic-analysis
0
votes
3
answers
Solve a set of inter-related recurrence relations
asked
Dec 10, 2022
in
Branch & Bound
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
0
votes
1
answer
Asymptotically compare 14 T(n/4) + O(n) and 7 R(n/2) + O(n).
asked
Dec 10, 2022
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
0
votes
3
answers
Solve or estimate this recurrence relation T(n) = 2 T(n/3) + T(n/2) + n
asked
Jun 1, 2021
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
not-master-theorem
0
votes
6
answers
Solve this recurrence relation: T(n) = 3 T(n/4) + O(n^0.75)
asked
Jun 13, 2020
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
substitution-method
master-theorem
0
votes
7
answers
Solve this recurrence relation: T(n) = T(n-1) + T(n/2) + 1
asked
Jun 13, 2020
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
substitution-method
0
votes
2
answers
Solving this recurrence relation: T(n) = 2 T(n/2) + f(n)
asked
Sep 24, 2019
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
0
votes
1
answer
Solve this recurrence relation: T(n) = T(n/3) + T(n/5) + T(n/6) + n
asked
Sep 19, 2019
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
0
votes
1
answer
Solve the Recurrence Relation: T(n) = T(n/4) + T(3n/4) + n^2
asked
May 7, 2018
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
asked
Jun 8, 2017
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
recurrence-relations
+10
votes
3
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
AlgoMeister
(
1.6k
points)
asymptotic-analysis
recurrence-relations
time-complexity
substitution-method
+1
vote
4
answers
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)
recurrence-relations
asymptotic-analysis
time-complexity
+2
votes
4
answers
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
AlgoMeister
(
1.6k
points)
recurrence-relations
time-complexity
asymptotic-analysis
+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
AlgoMeister
(
1.6k
points)
recurrence-relations
substitution-method
asymptotic-analysis
+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
(
920
points)
time-complexity
loops
asymptotic-analysis
recursive
recurrence-relations
0
votes
1
answer
Tree method or PMI?
asked
Sep 28, 2016
in
Divide & Conquer
by
taoran_xue
AlgoStar
(
440
points)
recurrence-relations
+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
(
768
points)
master-theorem
recurrence-relations
+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)
master-theorem
recurrence-relations
+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
(
372
points)
time-complexity
recurrence-relations
substitution-method
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
...