Skip to content

Commit 17db8f3

Browse files
64json64json
committed
Merge branch 'gh-pages' of https://github.com/parkjs814/AlgorithmVisualizer into gh-pages
2 parents 99c5a3e + 27440d3 commit 17db8f3

20 files changed

Lines changed: 89 additions & 19 deletions

File tree

‎algorithm/category.json‎

Lines changed: 11 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -43,10 +43,20 @@
4343
"edit_distance": "Edit Distance"
4444
}
4545
},
46+
"dp": {
47+
"name": "Dynamic Programming",
48+
"list": {
49+
"fibonacci": "Fibonacci sequence",
50+
"knapsack_problem": "Knapsack problem",
51+
"longest_increasing_subsequence": "Longest increasing subsequence",
52+
"max_subarray": "Maximum subarray",
53+
"max_sum_path": "Maximum sum path",
54+
"sliding_window": "Sliding window"
55+
}
56+
},
4657
"etc": {
4758
"name": "Uncategorized",
4859
"list": {
49-
"dp": "Dynamic Programming"
5060
}
5161
}
5262
}

algorithm/etc/dp/fibonacci/code.js renamed to algorithm/dp/fibonacci/basic/code.js

File renamed without changes.

algorithm/etc/dp/fibonacci/data.js renamed to algorithm/dp/fibonacci/basic/data.js

File renamed without changes.

‎algorithm/dp/fibonacci/desc.json‎

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
{
2+
"Fivonacci": "Finding fibonacci sequence using dynamic programming.",
3+
"Complexity": {
4+
"time": "O(n<sup>2</sup>",
5+
"space": "O(n)"
6+
},
7+
"References": [
8+
"<a href='https://en.wikipedia.org/wiki/Dynamic_programming#Fibonacci_sequence'>Wikipedia</a>"
9+
],
10+
"files": {
11+
"basic": "Fibonacci Sequence"
12+
}
13+
}

algorithm/etc/dp/knapsack_problem/code.js renamed to algorithm/dp/knapsack_problem/basic/code.js

File renamed without changes.

algorithm/etc/dp/knapsack_problem/data.js renamed to algorithm/dp/knapsack_problem/basic/data.js

File renamed without changes.

‎algorithm/dp/knapsack_problem/desc.json‎

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
{
2+
"Knapsack problem": "Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible.",
3+
"Complexity": {
4+
"time": "O(n<sup>2</sup>",
5+
"space": "O(n<sup>2</sup>)"
6+
},
7+
"References": [
8+
"<a href='https://en.wikipedia.org/wiki/Knapsack_problem'>Wikipedia</a>"
9+
],
10+
"files": {
11+
"basic": "Knapsack problem"
12+
}
13+
}

algorithm/etc/dp/longest_increasing_subsequence/code.js renamed to algorithm/dp/longest_increasing_subsequence/basic/code.js

File renamed without changes.

algorithm/etc/dp/longest_increasing_subsequence/data.js renamed to algorithm/dp/longest_increasing_subsequence/basic/data.js

File renamed without changes.

‎algorithm/dp/longest_increasing_subsequence/desc.json‎

Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
{
2+
"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",
3+
"Complexity": {
4+
"time": "O(n(log n))",
5+
"space": "O(n)"
6+
},
7+
"References": [
8+
"<a href='https://en.wikipedia.org/wiki/Longest_increasing_subsequence'>Wikipedia</a>"
9+
],
10+
"files": {
11+
"basic": "Longest increasing subsequence"
12+
}
13+
}

0 commit comments

Comments
 (0)