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
(7)
Backtracking/DFS/BFS
(2)
Branch & Bound
(2)
Graph Theory
(15)
NPCompleteness
(4)
Recent questions and answers
Most popular tags
timecomplexity
asymptoticnotation
recurrencerelations
loops
graph
asymptoticanalysis
dynamicprogramming
analysis
vertexcoloring
greedy
log
exponent
mvcs
npcompleteness
mastertheorem
smalloh
nestedloops
sortedlists
example
recursive
graphcoloring
randomgraphgeneration
proxy
network
substitutionmethod
branchandbound
d&c
degreeconstrained
spanningtree
vertexcover
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
0
votes
0
answers
Chromatic Number, Relation to Max Degree
asked
22 hours
ago
in
Greedy Algorithms
by
Amrinder Arora
(
206
points)
graphcoloring
graph
greedy
0
votes
2
answers
How to generate a random connected graph?
answered
Nov 14
in
Graph Theory
by
dtlafever
(
248
points)
graph
randomgraphgeneration
+1
vote
2
answers
Calculate g(1000) given the following definition of g function..
answered
Oct 21
in
Dynamic Programming
by
Dong
(
128
points)
recurrencerelations
0
votes
1
answer
What's the time complexity when j increases by j += log(j+5)?
answered
Sep 13
in
Asymptotic Analysis
by
Amrinder Arora
(
206
points)
loops
log
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
in
Divide & Conquer
by
jiahe0510
(
128
points)
sortedlists
searching
0
votes
0
answers
Graph with no 3clique that needs at least 4 colors
asked
Jul 24
in
Graph Theory
by
Amrinder Arora
(
206
points)
graph
vertexcoloring
0
votes
0
answers
Maximum Value Contiguous Subregion
asked
Jul 23
in
Dynamic Programming
by
Amrinder Arora
(
206
points)
mvcs
dynamicprogramming
+2
votes
1
answer
Maximum Value But Limited Neighbors
answered
Jul 18
in
Dynamic Programming
by
Amrinder Arora
(
206
points)
+1
vote
1
answer
Time Complexity Analysis  Nested Loops  Inner Increments by sqrt(k)
answered
Jul 12
in
Asymptotic Analysis
by
Amrinder Arora
(
206
points)
timecomplexity
nestedloops
sqrt
+1
vote
1
answer
"Fast Response" Locating a Proxy Server for the network
answered
Jul 12
in
Greedy Algorithms
by
Amrinder Arora
(
206
points)
proxy
network
greedy
0
votes
5
answers
Magical eggs and tiny floors
answered
Jun 19
in
Dynamic Programming
by
Baijun Xie
AlgoStar
(
400
points)
dynamicprogramming
eggs
floors
+3
votes
1
answer
log(n!) = Theta(nlogn)
answered
Jun 15
in
Asymptotic Analysis
by
Chris
AlgoStar
(
408
points)
asymptoticnotation
+1
vote
3
answers
Solve the recurrence Relation: T(n) = T(n/3) + T(2n/3) + n
answered
May 4
in
Divide & Conquer
by
zhouce
Active
(
276
points)
recurrencerelations
substitutionmethod
asymptoticanalysis
+1
vote
0
answers
What's the time complexity for solving Sudoku with backtrace method?
asked
Apr 28
in
NPCompleteness
by
shijie
Active
(
276
points)
timecomplexity
+3
votes
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
answered
Mar 20
in
Asymptotic Analysis
by
Amrinder Arora
(
206
points)
+8
votes
4
answers
Solve the recurrence relation: T(n)=T(n/2)+T(n/3)+T(n/4) + n
answered
Mar 7
in
Divide & Conquer
by
zhouce
Active
(
276
points)
asymptoticanalysis
recurrencerelations
timecomplexity
+2
votes
1
answer
How to get the time complexity of these algorithms, in terms of n in quiz 2?
answered
Feb 20
in
Asymptotic Analysis
by
Ethan Huang
AlgoMeister
(
648
points)
+2
votes
1
answer
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
answered
Feb 15
in
Divide & Conquer
by
liyanbo
Active
(
312
points)
recurrencerelations
timecomplexity
asymptoticanalysis
+1
vote
1
answer
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
answered
Feb 8
in
Asymptotic Analysis
by
Hao Wen
(
196
points)
recurrencerelations
asymptoticanalysis
timecomplexity
+1
vote
1
answer
In Quickselect, T(n)<=T(n/5)+T(7n/10)+cn, prove that T(n) = O(n)
answered
Feb 7
in
Divide & Conquer
by
Hao Wen
(
196
points)
To see more, click for the
full list of questions
or
popular tags
.
The Book: Analysis and Design of Algorithms

Presentations on Slideshare

Lecture Notes, etc
...