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
(38)
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 and answers in Divide & Conquer
Most popular tags
asymptotic-analysis
recurrence-relations
time-complexity
loops
asymptotic-notation
graph
dynamic-programming
greedy
substitution-method
analysis
a-star
np-completeness
nested-loops
vertex-coloring
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 and answers in Divide & Conquer
+1
vote
3
answers
Three Set Sum: Given an integer k and 3 sets A, B and C, find a, b, c such that a + b + c = k
answered
Dec 22, 2023
in
Divide & Conquer
by
Adoniasequeira
(
148
points)
sorted-lists
searching
0
votes
3
answers
Solve or estimate this recurrence relation T(n) = 2 T(n/3) + T(n/2) + n
answered
Dec 20, 2023
in
Divide & Conquer
by
Joanne Hsieh
(
164
points)
recurrence-relations
asymptotic-analysis
not-master-theorem
0
votes
2
answers
Solving this recurrence relation: T(n) = 2 T(n/2) + f(n)
answered
Dec 16, 2023
in
Divide & Conquer
by
iamphani
(
196
points)
recurrence-relations
+2
votes
4
answers
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
answered
Dec 13, 2023
in
Divide & Conquer
by
Mayurchaturvedi
(
132
points)
recurrence-relations
time-complexity
asymptotic-analysis
0
votes
7
answers
Solve this recurrence relation: T(n) = T(n-1) + T(n/2) + 1
answered
Dec 12, 2023
in
Divide & Conquer
by
harish05
AlgoStar
(
404
points)
recurrence-relations
asymptotic-analysis
substitution-method
+1
vote
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
answered
Nov 21, 2023
in
Divide & Conquer
by
SasmiP
AlgoMeister
(
584
points)
recurrence-relations
substitution-method
asymptotic-analysis
0
votes
6
answers
N-th power of complex number z = x + iy in O(log n) time
answered
Jul 9, 2020
in
Divide & Conquer
by
shaddymoumen
(
144
points)
logn
0
votes
6
answers
Solve this recurrence relation: T(n) = 3 T(n/4) + O(n^0.75)
answered
Jul 1, 2020
in
Divide & Conquer
by
shaddymoumen
(
144
points)
recurrence-relations
asymptotic-analysis
substitution-method
master-theorem
0
votes
1
answer
Solve this recurrence relation: T(n) = T(n/3) + T(n/5) + T(n/6) + n
answered
Sep 22, 2019
in
Divide & Conquer
by
oxley
Active
(
288
points)
recurrence-relations
asymptotic-analysis
time-complexity
substitution-method
+1
vote
3
answers
The Subarray with the Minimum Peak
answered
May 2, 2019
in
Divide & Conquer
by
Ruan XiangNing
AlgoMeister
(
948
points)
peak
min-max
+4
votes
2
answers
How to find the "joint" median of 3 sorted lists, in less than linear time?
answered
May 1, 2019
in
Divide & Conquer
by
Ruan XiangNing
AlgoMeister
(
948
points)
median
sorted-lists
+4
votes
4
answers
Rectangles overlap
answered
May 1, 2019
in
Divide & Conquer
by
Ruan XiangNing
AlgoMeister
(
948
points)
0
votes
1
answer
Find the smallest domain value where the function becomes negative.
answered
Jan 27, 2019
in
Divide & Conquer
by
PhotonCat
Active
(
304
points)
+10
votes
3
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
answered
Mar 7, 2017
in
Divide & Conquer
by
zhouce
Active
(
276
points)
asymptotic-analysis
recurrence-relations
time-complexity
substitution-method
+3
votes
1
answer
In Quickselect, T(n)<=T(n/5)+T(7n/10)+cn, prove that T(n) = O(n)
answered
Feb 7, 2017
in
Divide & Conquer
by
Hao Wen
(
212
points)
+1
vote
1
answer
MVCS using Divide and Conquer
answered
Dec 3, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
mvcs
d&c
0
votes
1
answer
Tree method or PMI?
answered
Sep 28, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
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
Help get things started by
asking a question
.
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...