Merge remote-tracking branch 'upstream/gh-pages'

Author: duaraghav8@gmail

README.md

@@ -11,7 +11,7 @@ http://parkjs814.github.io/AlgorithmVisualizer
 ### Contributing
 If you run _Algorithm Visualizer_ locally and files are not loaded because Cross-Origin Requests are blocked, use [http-server](https://github.com/indexzero/http-server) or [SimpleHTTPServer](https://docs.python.org/2/library/simplehttpserver.html) to resolve the issue. [(Issue #2)](https://github.com/parkjs814/AlgorithmVisualizer/issues/2)
 
-If in need of any help check out or [**Wiki**](https://github.com/parkjs814/AlgorithmVisualizer/wiki) or join our [Gitter](https://gitter.im/parkjs814/AlgorithmVisualizer?utm_source=share-link&utm_medium=link&utm_campaign=share-link) chatroom!
+If in need of any help check out [**Wiki**](https://github.com/parkjs814/AlgorithmVisualizer/wiki) or join our [Gitter](https://gitter.im/parkjs814/AlgorithmVisualizer?utm_source=share-link&utm_medium=link&utm_campaign=share-link) chatroom!
 ### Backers
 
 Support us with a monthly donation and help us continue our activities. [[Become a backer](https://opencollective.com/algorithmvisualizer#backer)]

algorithm/category.json

@@ -30,10 +30,10 @@
       "insertion": "Insertion Sort",
       "selection": "Selection Sort",
       "bubble": "Bubble Sort",
-      "quick": "Quicksort",
       "merge": "Merge Sort",
-      "heap" : "Heapsort",
       "radix": "Radix Sort",
+      "quick": "Quicksort",
+      "heap" : "Heapsort",
       "shell": "Shellsort"
     }
   },
@@ -47,12 +47,13 @@
    "dp": {
     "name": "Dynamic Programming",
     "list": {
-      "fibonacci": "Fibonacci sequence",
-      "knapsack_problem": "Knapsack problem",
-      "longest_increasing_subsequence": "Longest increasing subsequence",
-      "max_subarray": "Maximum subarray",
-      "max_sum_path": "Maximum sum path",
-      "sliding_window": "Sliding window"
+      "fibonacci": "Fibonacci Sequence",
+      "knapsack_problem": "Knapsack Problem",
+      "longest_increasing_subsequence": "Longest Increasing Subsequence",
+      "max_subarray": "Maximum Subarray",
+      "max_sum_path": "Maximum Sum Path",
+      "sliding_window": "Sliding Window",
+      "integer_partition": "Integer Partition"
     }
    },
   "etc": {

algorithm/dp/integer_partition/basic/code.js

@@ -0,0 +1,32 @@
+function partition(A, n, p){
+  if (n === 0) tracer.logTracer._print('[' + A.join(', ') + ']');
+  else {
+    var end = n;
+    if (p !== 0 && A[p-1] < n) end = A[p-1];
+    for (var i = end; i > 0; i--){
+        A[p] = i;
+        partition(A, n-i, p+1);
+    }
+  }
+}
+
+function integerPartition(n){
+  //Calculate number of partitions for all numbers from 1 to n
+  for (var i = 2; i <= n; i++){
+    // We are allowed to use numbers from 2 to i
+    for (var j = 1; j <= i; j++){
+      // Number of partitions without j number + number of partitions with max j
+      tracer._select(i, j)._wait();
+      D[i][j] = D[i][j-1] + D[i-j][Math.max(j, i-j)];
+      tracer._notify(i, j, D[i][j])._wait();
+      tracer._denotify(i, j);
+      tracer._deselect(i, j);
+    }
+  }
+  return D[n][n];
+}
+
+tracer.logTracer._print('Partitioning: ' + integer);
+partition(A, integer, 0);
+var part = integerPartition(integer);
+tracer.logTracer._print(part);

algorithm/dp/integer_partition/basic/data.js

@@ -0,0 +1,10 @@
+var tracer = new Array2DTracer().attach(new LogTracer());
+var integer = Math.floor(Math.random() * 10) + 5;
+var D = [], A = [];
+for (var i = 0; i <= integer; i++){
+  D.push([]);
+  D[0][i] = 1;
+  D[i][1] = 1;
+  for (var j = 0; j <= integer; j++) D[i][j]=0;
+}
+tracer._setData(D);

algorithm/dp/integer_partition/desc.json

@@ -0,0 +1,13 @@
+{
+  "Integer Partition": "In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers.",
+  "Complexity": {
+    "time": "O(n(log n))",
+    "space": "O(n<sup>2</sup>)"
+  },
+  "References": [
+    "<a href='https://en.wikipedia.org/wiki/Partition_(number_theory)'>Wikipedia</a>"
+  ],
+  "files": {
+    "basic": "Integer partition"
+  }
+}

algorithm/dp/knapsack_problem/desc.json

@@ -1,7 +1,7 @@
 {
   "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.",
   "Complexity": {
-    "time": "O(n<sup>2</sup>",
+    "time": "O(n<sup>2</sup>)",
     "space": "O(n<sup>2</sup>)"
   },
   "References": [

algorithm/string/knuth_morris_pratt/substring_search/code.js

@@ -3,11 +3,6 @@ Number.prototype.mod = function (n) {
     return ((this%n)+n)%n;
 };
 
-function randString (length) {
-	var result = Math.random ().toString (36);
-	return result.substring (result.length - length);
-}
-
 function tracker (substring) {
 	var i = 1, j = 0;
 
@@ -110,4 +105,4 @@ var positions = kmp (string, substring);
 logger._print ('Substring positions are: ' + (positions.length ? String (positions) : 'NONE'));
 for (var i = 0; i < positions.length; i++) {
 	stringTracer._select (positions [i], positions [i] + substring.length - 1)._wait ();
-}
+}