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
+1
vote
3
answers
Time Complexity Analysis - Odd Even - Big Jumps
asked
Jan 19, 2016
in
Asymptotic Analysis
by
anonymous
analysis
loops
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
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
2
answers
k-degree constrained spanning tree
asked
Dec 2, 2016
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
spanning-tree
degree-constrained
+1
vote
1
answer
Time Complexity Analysis - Nested Loops - Inner Increments by sqrt(k)
asked
Jul 12, 2017
in
Asymptotic Analysis
by
Baijun Xie
AlgoStar
(
416
points)
time-complexity
nested-loops
sqrt
+1
vote
3
answers
“Teleportation” across astro-haunted galaxies
asked
Mar 4, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
dynamic-programming
+1
vote
2
answers
Order these time complexities from best (lowest) to worst (highest)
asked
Aug 31, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
log
exponent
+4
votes
1
answer
Maximum Value But Limited Neighbors
asked
Jun 20, 2017
in
Dynamic Programming
by
Baijun Xie
AlgoStar
(
416
points)
0
votes
1
answer
Prove that Vertex Cover is NP-hard problem
asked
Nov 20, 2016
in
NP-Completeness
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
np-completeness
reduction
vertex-cover
+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
0
votes
3
answers
Trichotomy in Context of Asymptotic Functions
asked
Jan 29, 2016
in
Asymptotic Analysis
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
asymptotic-notation
trichotomy
0
votes
1
answer
What's the time complexity when j increases by j += log(j+5)?
asked
Sep 10, 2017
in
Asymptotic Analysis
by
Yan Zhang
(
132
points)
loops
log
+1
vote
3
answers
Minimizing Weight of a Linear Partition
asked
Nov 20, 2016
in
Dynamic Programming
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
array
dynamic-programming
minimize
+2
votes
1
answer
How to get the time complexity of these algorithms, in terms of n in quiz 2?
asked
Feb 18, 2017
in
Asymptotic Analysis
by
liyanbo
(
176
points)
+1
vote
2
answers
Count Primes - Time Complexity
asked
Sep 11, 2016
in
Asymptotic Analysis
by
Shuyue
(
216
points)
time-complexity
asymptotic-notation
prime-numbers
count
0
votes
2
answers
Graph that has 10 vertices, is 3-colorable and number of edges is maximized
asked
Aug 23, 2016
in
Graph Theory
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
graph
vertex-coloring
example
+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
+1
vote
1
answer
Time complexity of recursive function - Single recursive call of size n/3 and n^2 loop
asked
Oct 3, 2016
in
Asymptotic Analysis
by
Roc6212
AlgoMeister
(
752
points)
asymptotic-analysis
time-complexity
nested-loops
loops
0
votes
2
answers
Admissible Heuristic for n-Queens Problem
asked
Mar 24, 2018
in
Informed Search
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
n-queens
conflict
ai
+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
asked
Jul 23, 2017
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
sorted-lists
searching
Page:
« prev
1
2
3
4
5
...
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...