Remember
Register
Algorithms Q&A
Smart HCM Software
Get the course textbook
Questions
Unanswered
Ask a Question
Lecture Notes
Not Exponential, on Twitter
All categories
Asymptotic Analysis
(22)
Divide & Conquer
(9)
Greedy Algorithms
(2)
Dynamic Programming
(8)
Backtracking/DFS/BFS
(2)
Branch & Bound
(2)
Graph Theory
(15)
NPCompleteness
(6)
Recent questions and answers in Divide & Conquer
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
vertexcoloring
analysis
npcompleteness
greedy
log
exponent
mvcs
vertexcover
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
satisfiability
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
reduction
dfs
subtree
primenumbers
sqrt
lecture1
math
tree
count
minimize
floors
array
median
knapsack
trichotomy
eggs
searching
function
relation
gcd
tetris
Recent questions and answers in Divide & Conquer
0
votes
1
answer
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
Aug 11, 2017
in
Divide & Conquer
by
jiahe0510
(
128
points)
sortedlists
searching
+1
vote
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
answered
May 4, 2017
in
Divide & Conquer
by
zhouce
Active
(
276
points)
recurrencerelations
substitutionmethod
asymptoticanalysis
+8
votes
4
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)
asymptoticanalysis
recurrencerelations
timecomplexity
+2
votes
1
answer
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
answered
Feb 15, 2017
in
Divide & Conquer
by
liyanbo
Active
(
312
points)
recurrencerelations
timecomplexity
asymptoticanalysis
+1
vote
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
(
196
points)
+2
votes
3
answers
Rectangles overlap
answered
Dec 6, 2016
in
Divide & Conquer
by
tinggu
(
120
points)
+1
vote
1
answer
MVCS using Divide and Conquer
answered
Dec 3, 2016
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
mvcs
d&c
0
votes
1
answer
Tree method or PMI?
answered
Sep 28, 2016
in
Divide & Conquer
by
Amrinder Arora
(
230
points)
recurrencerelations
+2
votes
3
answers
Can T(n) = 2T(n/2) + nlogn use master theorem?
answered
Sep 21, 2016
in
Divide & Conquer
by
taoran_xue
Active
(
276
points)
mastertheorem
recurrencerelations
Help get things started by
asking a question
.
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...