Remember
Register
Algorithms Q&A
Nobel Prize in Economics
Algorithms Textbook
Q&A
Questions
Unanswered
Ask a Question
AI Teams
Lecture Notes
User Nikith
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 Nikith
0
votes
Solve the recurrence relation: T(n) = 3 T(n/2) + n^1.5 log n
answered
Dec 10, 2023
in
Divide & Conquer
recurrence-relations
time-complexity
asymptotic-analysis
0
votes
Solve this recurrence relation: T(n) = T(n/2) + n/log n
answered
Dec 9, 2023
recurrence-relations
asymptotic-analysis
time-complexity
+2
votes
Given an array of numbers, find triplets i,j,k such that a[i] + a[j] = a[k]
answered
Dec 3, 2023
exam
+1
vote
Solve or estimate this recurrence relation T(n) = 2 T(n/3) + T(n/2) + n
answered
Nov 29, 2023
in
Divide & Conquer
recurrence-relations
asymptotic-analysis
not-master-theorem
+2
votes
Nested loop analysis, outer loop grows by sqrt n, inner randomly
answered
Nov 28, 2023
in
Asymptotic Analysis
time-complexity
sqrt
nested-loops
loops
asymptotic-analysis
+1
vote
MVCS of Alternating Positive and Negative Numbers - Which Statements are True?
answered
Nov 21, 2023
mvcs
dynamic-programming
proof
counter-example
The Book: Analysis and Design of Algorithms
|
Presentations on Slideshare
|
Lecture Notes, etc
...
| Presentations on Slideshare | Lecture Notes, etc