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)
Recent questions in Asymptotic Analysis
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 in Asymptotic Analysis
0
votes
0
answers
Analyze Triple Loop - j and k start with i^2 and j^2 respectively
asked
Nov 4
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
loops
asymptotic-notation
analysis
exam
+1
vote
5
answers
Nested loop analysis, outer loop grows by sqrt n, inner randomly
asked
Nov 10, 2023
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
time-complexity
sqrt
nested-loops
loops
asymptotic-analysis
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
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
1
answer
Use the limit method to prove the asymptotic relation between these 3 functions
asked
May 24, 2021
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
limit-method
small-oh
small-omega
asymptotic-analysis
0
votes
2
answers
Highest sum of tree heights when one recoloring is allowed
asked
May 5, 2020
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
loops
+1
vote
4
answers
outer loop until log n, inner loop exponential increase
asked
Jul 8, 2018
in
Asymptotic Analysis
by
basil
Active
(
340
points)
time-complexity
asymptotic-analysis
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
Time Complexity 0.25 * n and k +=k
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
time-complexity
nested-loops
loops
+3
votes
1
answer
Time Complexity (3 loops with gcd)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
loops
nested-loops
gcd
easy
0
votes
1
answer
Time Complexity increasing by n^(1/3)log(n)
asked
Mar 4, 2018
in
Asymptotic Analysis
by
jmlitfi
AlgoMeister
(
684
points)
time-complexity
0
votes
1
answer
What's the time complexity when j increases by j += log(j+5)?
asked
Sep 10, 2017
in
Asymptotic Analysis
by
Yan Zhang
(
132
points)
loops
log
+1
vote
1
answer
Time Complexity Analysis - Nested Loops - Inner Increments by sqrt(k)
asked
Jul 12, 2017
in
Asymptotic Analysis
by
Baijun Xie
AlgoStar
(
416
points)
time-complexity
nested-loops
sqrt
+3
votes
1
answer
log(n!) = Theta(nlogn)
asked
May 9, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
asymptotic-notation
+3
votes
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
asked
Mar 2, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
+2
votes
1
answer
How to get the time complexity of these algorithms, in terms of n in quiz 2?
asked
Feb 18, 2017
in
Asymptotic Analysis
by
liyanbo
(
176
points)
+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
+1
vote
3
answers
The executive time of program in eclipse seems to be randomly when the times are not very large
asked
Jan 22, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
+2
votes
1
answer
Loop i through log n incremented by constant multiplication
asked
Dec 4, 2016
in
Asymptotic Analysis
by
abdulgood89
AlgoStar
(
416
points)
loops
while-loop
logn
easy
+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
Page:
1
2
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...