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
Hot questions
+1
vote
1
answer
"Fast Response" Locating a Proxy Server for the network
asked
Jul 12, 2017
in
Greedy Algorithms
by
Baijun Xie
AlgoStar
(
416
points)
proxy
network
greedy
+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)
+3
votes
1
answer
Solve the recurrence relation: T(n)=T(n/2)+T(n^0.5)+n
asked
Mar 2, 2017
in
Asymptotic Analysis
by
shijie
Active
(
276
points)
+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
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
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
+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
+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
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
+2
votes
1
answer
Cook-Levin Theorem
asked
Dec 6, 2016
in
NP-Completeness
by
Roc6212
AlgoMeister
(
752
points)
+1
vote
1
answer
MVCS using Divide and Conquer
asked
Dec 3, 2016
in
Divide & Conquer
by
Amrinder Arora
AlgoMeister
(
1.6k
points)
mvcs
d&c
+2
votes
1
answer
Loop i through log n incremented by constant multiplication
asked
Dec 4, 2016
in
Asymptotic Analysis
by
abdulgood89
AlgoStar
(
416
points)
loops
while-loop
logn
easy
+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
+1
vote
2
answers
Topological Sort
asked
Nov 5, 2016
in
Backtracking/DFS/BFS
by
Chetan Mahajan
(
180
points)
dfs
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
+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
+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
+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
+2
votes
1
answer
Heap removing and adding
asked
Oct 6, 2016
in
Graph Theory
by
taoran_xue
AlgoStar
(
440
points)
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
Page:
« prev
1
...
4
5
6
7
8
next »
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...