Greatest subsequential sum: Difference between revisions

Content deleted Content added

Inline

@@ Line 1,450: / Line 1,450: @@
 =={{header|JavaScript}}==
 Simple brute force approach.
-<lang javascript>
+<lang javascript>function MaximumSubsequence(population) {
+    var maxValue = 0;
-function MaximumSubsequence( population ) {
-	var maxValue = 0;
+    var subsequence = [];
-	var subsequence = [];
+    for (var i = 0, len = population.length; i < len; i++) {
-	for( var i=0, len=population.length; i < len; i++ ) {
+        for (var j = i; j <= len; j++) {
+            var subsequence = population.slice(i, j);
-		for( var j=i; j <= len; j++ ) {
+            var value = sumValues(subsequence);
-			var subsequence = population.slice(i,j);
+            if (value > maxValue) {
-			var value = sumValues(subsequence);
-			if( value > maxValue ) {
+                maxValue = value;
+                greatest = subsequence;
-				maxValue = value;
+            };
-				greatest = subsequence;
+        }
-			};
+    }
-		}
-	}
+    return greatest;
-	return greatest;
 }
 function sumValues(arr) {
-	var result = 0;
+    var result = 0;
-	for( var i=0, len=arr.length; i < len; i++) {
+    for (var i = 0, len = arr.length; i < len; i++) {
-		result += arr[i];
+        result += arr[i];
+    }
-	}
-	return result;
+    return result;
 }</lang>