Merge pull request TheAlgorithms#49 from Dharni0607/arrays

O(n) solution for maximum contiguos subarray sum

other/maxSubarraySum.go

@@ -0,0 +1,30 @@
+/* O(n) solution, for calculating 
+maximum contiguous sum in the given array. */
+
+package main
+
+import (
+	"fmt"
+)
+
+func Max(x int, y int) int {
+    if x < y {
+        return y
+    }
+    return x
+}
+
+func maxSubarraySum(array []int) int {
+    var currentMax int = 0
+    var maxTillNow int = 0
+    for i := 0; i < len(array); i++ {
+	    currentMax = Max(array[i], currentMax + array[i])
+	    maxTillNow = Max(maxTillNow, currentMax)
+	}
+	return maxTillNow
+}
+
+func main() {
+	array := []int{-2, -5, 6, 0, -2, 0, -3, 1, 0, 5, -6}
+	fmt.Println("Maximum contiguous sum: ",  maxSubarraySum(array))
+}