forked from algorithm-visualizer/algorithm-visualizer
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdesc.json
More file actions
16 lines (16 loc) · 859 Bytes
/
desc.json
File metadata and controls
16 lines (16 loc) · 859 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
{
"Dynamic Programming": "Dynamic programming is both a mathematical optimization method and a computer programming method. In both contexts it refers to simplifying a complicated problem by breaking it down into simpler sub-problems in a recursive manner.",
"Complexity": {
"time": "varies",
"space": "varies"
},
"References": [
"<a href='https://en.wikipedia.org/wiki/Dynamic_programming'>Wikipedia</a>"
],
"files": {
"fibonacci": "Fibonacci Sequence",
"sliding_window": "Finding the largest sum of three contiguous number",
"max_sum_path": "Finding the maximum sum in a path from (0, 0) to (N-1, M-1) when can only move to right or down",
"longest_increasing_subsequence": "Find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order"
}
}