Remember
Register
Algorithms Q&A
Smart HR Software
Get the algorithms textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
Recent
Hot!
Most votes
Most answers
Most views
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(36)
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
dynamic-programming
asymptotic-notation
greedy
substitution-method
a-star
np-completeness
nested-loops
vertex-coloring
mdp
log
analysis
probability
stochastic
heuristic
master-theorem
markov-model
n-puzzle
csp
graph-coloring
mvcs
small-oh
exponent
proof
viterbi
bayes-rule
hmm
tree-search
grid-world
admissible
n-queens
conflict
ai
clique
exam
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
Most answered questions
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
8
answers
Gold is a precious metal
asked
Mar 29, 2019
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
maximize-value
gold
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
6
answers
N-th power of complex number z = x + iy in O(log n) time
asked
Jun 13, 2020
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
logn
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
6
answers
Asymptotic Analysis - Triple Loop - k starts from j^2
asked
Jul 2, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
loops
analysis
+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
5
answers
"SpicyBitter" Sequence of Sauces
asked
Jun 16, 2020
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
+1
vote
5
answers
Graph with no 3-clique that needs at least 4 colors
asked
Jul 24, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
+1
vote
5
answers
Given f(n) = o(g(n)), prove that 2^f(n) = o(2^g(n))
asked
Sep 12, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
exponent
log
small-oh
asymptotic-notation
0
votes
5
answers
Magical eggs and tiny floors
asked
Jun 29, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
eggs
floors
0
votes
4
answers
True or False: Every graph of 6 vertices must have either an Independent Set of size >= 3 or a clique of size >= 3.
asked
Dec 10, 2023
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
clique
independent-set
0
votes
4
answers
Graph that has 2 long paths
asked
Dec 9, 2023
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
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
+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
+4
votes
4
answers
Long chain of friends
asked
May 6, 2018
in
NP-Completeness
by
zzkaing
Active
(
268
points)
np-completeness
0
votes
4
answers
1-D k-means clustering
asked
Mar 8, 2018
in
Dynamic Programming
by
duankebo
(
116
points)
0
votes
4
answers
Is Greed the best choice?
asked
Mar 3, 2018
in
Greedy Algorithms
by
jmlitfi
AlgoMeister
(
684
points)
greedy
+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
Page:
1
2
3
4
...
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...