add dp

64json · 64json · commit 3ce85c4d11b6 · 2016-05-20T03:34:45.000-05:00
diff --git a/algorithm/category.json b/algorithm/category.json
@@ -14,5 +14,11 @@
       "bubble": "Bubble Sort",
       "quick": "Quicksort"
     }
+  },
+  "etc": {
+    "name": "Uncategorized",
+    "list": {
+      "dp": "Dynamic Programming"
+    }
   }
 }
diff --git a/algorithm/etc/dp/config.json b/algorithm/etc/dp/config.json
@@ -0,0 +1,14 @@
+{
+  "def": "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.",
+  "apps": [],
+  "cpx": {
+    "time": "varies",
+    "space": "varies"
+  },
+  "refs": [
+    "https://en.wikipedia.org/wiki/Dynamic_programming"
+  ],
+  "files": {
+    "fibonacci": "Fibonacci Sequence"
+  }
+}
diff --git a/algorithm/etc/dp/fibonacci/code.js b/algorithm/etc/dp/fibonacci/code.js
@@ -0,0 +1,6 @@
+for (var i = 2; i < index; i++) {
+    D[i] = D[i - 2] + D[i - 1];
+    tracer._selectSet([i - 2, i - 1]);
+    tracer._notify(i);
+    tracer._deselectSet([i - 2, i - 1]);
+}
diff --git a/algorithm/etc/dp/fibonacci/data.js b/algorithm/etc/dp/fibonacci/data.js
@@ -0,0 +1,7 @@
+var tracer = new Array1DTracer();
+var index = 15;
+var D = [1, 1];
+for (var i = 2; i < index; i++) {
+    D.push(0);
+}
+tracer.setData(D);
diff --git a/algorithm/graph_search/bfs/config.json b/algorithm/graph_search/bfs/config.json
@@ -17,7 +17,7 @@
     "https://en.wikipedia.org/wiki/Breadth-first_search"
   ],
   "files": {
-    "basic": "Searching a tree",
+    "tree": "Searching a tree",
     "shortest_path": "Finding the shortest path"
   }
 }
diff --git a/algorithm/graph_search/bfs/tree/code.js b/algorithm/graph_search/bfs/tree/code.js
diff --git a/algorithm/graph_search/bfs/tree/data.js b/algorithm/graph_search/bfs/tree/data.js
diff --git a/algorithm/graph_search/dfs/config.json b/algorithm/graph_search/dfs/config.json
@@ -21,7 +21,7 @@
     "https://en.wikipedia.org/wiki/Depth-first_search"
   ],
   "files": {
-    "basic": "Searching a tree",
+    "tree": "Searching a tree",
     "all_paths": "Going through all possible paths without making any circuit",
     "weighted_graph": "DFS of Weighted Graph",
     "shortest_path": "Finding the shortest path"
diff --git a/algorithm/graph_search/dfs/tree/code.js b/algorithm/graph_search/dfs/tree/code.js
diff --git a/algorithm/graph_search/dfs/tree/data.js b/algorithm/graph_search/dfs/tree/data.js
diff --git a/css/stylesheet.css b/css/stylesheet.css
@@ -136,6 +136,7 @@ section {
     bottom: 50%;
     left: 0;
     right: 0;
+    overflow: scroll;
 }
 
 .tab_container {
diff --git a/js/module/array2d.js b/js/module/array2d.js
@@ -163,8 +163,18 @@ Array2DTracer.prototype.refresh = function () {
     Tracer.prototype.refresh.call(this);
 
     var $parent = $table.parent();
-    $table.css('margin-top', $parent.height() / 2 - $table.height() / 2);
-    $table.css('margin-left', $parent.width() / 2 - $table.width() / 2);
+    var top = $parent.height() / 2 - $table.height() / 2;
+    var left = $parent.width() / 2 - $table.width() / 2;
+    if (top < 0) {
+        $table.css('margin-top', 0);
+        $parent.scrollTop(-top);
+    }
+    else $table.css('margin-top', top);
+    if (left < 0) {
+        $table.css('margin-left', 0);
+        $parent.scrollLeft(-left);
+    }
+    else $table.css('margin-left', left);
 };
 
 // Override

Original file line number	Diff line number	Diff line change
`@@ -14,5 +14,11 @@`
`14`	`14`	`"bubble": "Bubble Sort",`
`15`	`15`	`"quick": "Quicksort"`
`16`	`16`	`}`
	`17`	`+ },`
	`18`	`+ "etc": {`
	`19`	`+ "name": "Uncategorized",`
	`20`	`+ "list": {`
	`21`	`+ "dp": "Dynamic Programming"`
	`22`	`+ }`
`17`	`23`	`}`
`18`	`24`	`}`
Original file line number	Diff line number	Diff line change
`@@ -17,7 +17,7 @@`
`17`	`17`	`"https://en.wikipedia.org/wiki/Breadth-first_search"`
`18`	`18`	`],`
`19`	`19`	`"files": {`
`20`		`- "basic": "Searching a tree",`
	`20`	`+ "tree": "Searching a tree",`
`21`	`21`	`"shortest_path": "Finding the shortest path"`
`22`	`22`	`}`
`23`	`23`	`}`