Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User princenoahjohnson123
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 princenoahjohnson123
0
votes
outer loop until log n, inner loop exponential increase
answered
Dec 12, 2023
in
Asymptotic Analysis
time-complexity
asymptotic-analysis
0
votes
Solve this recurrence using master theorem: T(n) = 2 T(n/2) + n^0.75
answered
Dec 10, 2023
in
Asymptotic Analysis
recurrence-relations
master-theorem
time-complexity
asymptotic-analysis
0
votes
Solve this recurrence relation: T(n) = T(n/2) + n/log n
answered
Dec 10, 2023
recurrence-relations
asymptotic-analysis
time-complexity
+1
vote
k-degree constrained spanning tree
answered
Dec 9, 2023
in
NP-Completeness
np-completeness
spanning-tree
degree-constrained
0
votes
Nested loop analysis, outer loop grows by sqrt n, inner randomly
answered
Dec 9, 2023
in
Asymptotic Analysis
time-complexity
sqrt
nested-loops
loops
asymptotic-analysis
+1
vote
Analyze the time complexity of this program
answered
Dec 9, 2023
asymptotic-analysis
nested-loops
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc