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 viewed questions
+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
+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
+3
votes
1
answer
log(n!) = Theta(nlogn)
asked
May 9, 2017
in
Asymptotic Analysis
by
shakexin
(
180
points)
asymptotic-notation
0
votes
3
answers
Time complexity of GCD algorithm
asked
Jan 14, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
gcd
recursive
0
votes
2
answers
How to generate a random connected graph?
asked
Oct 15, 2017
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
random-graph-generation
+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
0
votes
3
answers
Prove Ө(log 1 + log2 + log3 + log4 +... + logn) = Ө(n log n)
asked
Sep 15, 2016
in
Asymptotic Analysis
by
Roc6212
AlgoMeister
(
752
points)
log
+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
+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
(
752
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
(
380
points)
time-complexity
recurrence-relations
substitution-method
+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
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
+2
votes
4
answers
For-While Nested Loops Time Complexity - Inner Loop increments by n^1/3
asked
Sep 15, 2016
in
Asymptotic Analysis
by
WenjunMao
(
140
points)
time-complexity
loops
+4
votes
4
answers
Rectangles overlap
asked
Dec 4, 2016
in
Divide & Conquer
by
pandeng
(
152
points)
+1
vote
2
answers
Given f(n) = o(g(n)), show that it is not necessary that log (f(n)) = o(log (g(n)))
asked
Sep 12, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
small-oh
log
0
votes
2
answers
Prove that 3-Coloring is NP Hard (starting with SAT as known NP hard problem)
asked
Nov 29, 2017
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
vertex-coloring
satisfiability
+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
+3
votes
1
answer
In Quickselect, T(n)<=T(n/5)+T(7n/10)+cn, prove that T(n) = O(n)
asked
Feb 7, 2017
in
Divide & Conquer
by
Hao Wen
(
212
points)
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
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
Page:
1
2
3
4
...
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...