Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Amal_Q
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(37)
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)
Answers by Amal_Q
–1
vote
Time Complexity - Recursive function - Two recursive calls, and double nested loop
answered
Oct 5, 2016
in
Asymptotic Analysis
time-complexity
loops
asymptotic-analysis
recursive
recurrence-relations
+2
votes
MT for T(n) = 2T(n/2) + n^2 log n
answered
Sep 22, 2016
in
Asymptotic Analysis
master-theorem
recurrence-relations
+2
votes
Can T(n) = 2T(n/2) + nlogn use master theorem?
answered
Sep 20, 2016
in
Divide & Conquer
master-theorem
recurrence-relations
+1
vote
Count Primes - Time Complexity
answered
Sep 13, 2016
in
Asymptotic Analysis
time-complexity
asymptotic-notation
prime-numbers
count
+1
vote
Order these time complexities from best (lowest) to worst (highest)
answered
Aug 31, 2016
in
Asymptotic Analysis
asymptotic-notation
log
exponent
+1
vote
Graph that has 10 vertices, is 3-colorable and number of edges is maximized
answered
Aug 23, 2016
in
Graph Theory
graph
vertex-coloring
example
+2
votes
Graph Example n >= 6, delta >= 4, ki = 2
answered
Aug 20, 2016
in
Graph Theory
graph
vertex-coloring
example
+1
vote
Color this graph (n=10, m=15)
answered
Aug 16, 2016
in
Graph Theory
graph
vertex-coloring
greedy
0
votes
Asymptotic Analysis - Triple Loop - k starts from j^2
answered
Aug 7, 2016
in
Asymptotic Analysis
asymptotic-notation
loops
analysis
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...