Maximum Subarray Sum

Author: duaraghav8@gmail

algorithm/etc/dp/desc.json

@@ -11,6 +11,7 @@
     "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"
+    "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",
+    "max_subarray": "Find the sum of the maximum Subarray in the given Array"
   }
 }

algorithm/etc/dp/max_subarray/code.js

@@ -0,0 +1,29 @@
+var maxSubarraySum = (function maxSubarray (array) {
+	var maxSoFar = 0,
+		maxEndingHere = 0;
+
+	tracer._print ('Initializing maxSoFar = 0 & maxEndingHere = 0');
+
+	for (var i = 0; i < array.length; i++) {
+		tracer._select (i);
+		tracer._print (maxEndingHere + ' + ' + array [i]);
+		maxEndingHere += array [i];
+		tracer._print ('=> ' + maxEndingHere);
+
+		if (maxEndingHere < 0) {
+			tracer._print ('maxEndingHere is negative, set to 0');
+			maxEndingHere = 0;
+		}
+
+		if (maxSoFar < maxEndingHere) {
+			tracer._print ('maxSoFar < maxEndingHere, setting maxSoFar to maxEndingHere (' + maxEndingHere + ')');
+			maxSoFar = maxEndingHere;
+		}
+		
+		tracer._deselect (i);
+	}
+
+	return maxSoFar;
+}) (D);
+
+tracer._print ('Maximum Subarray\'s Sum is: ' + maxSubarraySum);

algorithm/etc/dp/max_subarray/data.js

@@ -0,0 +1,4 @@
+var tracer = new Array1DTracer ();
+var D = [-2, -3, 4, -1, -2, 1, 5, -3];
+
+tracer._setData (D);