Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User harish05
Wall
Recent activity
All questions
All answers
Categories
All categories
Math Basics
(5)
Asymptotic Analysis
(38)
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 harish05
0
votes
Solve this recurrence relation: T(n) = T(n-1) + T(n/2) + 1
answered
Dec 12, 2023
in
Divide & Conquer
recurrence-relations
asymptotic-analysis
substitution-method
0
votes
Solve or estimate this recurrence relation T(n) = 2 T(n/3) + T(n/2) + n
answered
Dec 12, 2023
in
Divide & Conquer
recurrence-relations
asymptotic-analysis
not-master-theorem
0
votes
Solve the recurrence Relation T(n)=T(n/5)+T(7n/10)+(n^2)
answered
Dec 12, 2023
in
Asymptotic Analysis
recurrence-relations
asymptotic-analysis
time-complexity
0
votes
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
answered
Dec 12, 2023
in
Divide & Conquer
recurrence-relations
time-complexity
asymptotic-analysis
0
votes
For-While Nested Loops Time Complexity - Inner Loop increments by n^1/3
answered
Dec 12, 2023
in
Asymptotic Analysis
time-complexity
loops
0
votes
outer loop until log n, inner loop exponential increase
answered
Dec 11, 2023
in
Asymptotic Analysis
time-complexity
asymptotic-analysis
+1
vote
Give an example of a graph that has 6 vertices, 9 edges, but does not have a clique on 3 vertices
answered
Dec 11, 2023
in
Graph Theory
graph
clique
+1
vote
Solve this recurrence using master theorem: T(n) = 2 T(n/2) + n^0.75
answered
Sep 10, 2023
in
Asymptotic Analysis
recurrence-relations
master-theorem
time-complexity
asymptotic-analysis
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc