New answers tagged dynamic-programming
3
votes
Accepted
Runtime analysis of Fibonacci series
When analyzing memoized code like this, it is unhelpful to think in terms of recurrences, because you don’t know when the recursive call will actually compute something nontrivial, possibly recursing ...
0
votes
How to cover elements with minimum amount of elements
I have elements from 1 to n and I am trying to cover all of the elements
No, you're not. You're trying to cover the continuous interval between the smallest and largest element. You need to improve ...
Top 50 recent answers are included
Related Tags
dynamic-programming × 987algorithms × 564
optimization × 114
graphs × 88
greedy-algorithms × 71
knapsack-problems × 65
recursion × 57
time-complexity × 41
combinatorics × 41
algorithm-analysis × 35
recurrence-relation × 35
data-structures × 34
arrays × 28
matrices × 28
subsequences × 28
trees × 26
strings × 26
memoization × 25
complexity-theory × 23
shortest-path × 22
runtime-analysis × 20
np-complete × 18
backtracking × 17
correctness-proof × 16
scheduling × 16