add kadane algorithm

Author: ashishps1

patterns/c#/KadaneAlgorithm.cs

@@ -0,0 +1,14 @@
+using System;
+
+public class KadaneAlgorithm {
+    public int MaxSubArray(int[] nums) {
+        int currentSum = nums[0];
+        int maxSum = nums[0];
+
+        for (int i = 1; i < nums.Length; i++) {
+            currentSum = Math.Max(nums[i], currentSum + nums[i]);
+            maxSum = Math.Max(maxSum, currentSum);
+        }
+        return maxSum;
+    }
+}

patterns/c++/KadaneAlgorithm.cpp

@@ -0,0 +1,15 @@
+package main
+
+import "math"
+
+func maxSubArray(nums []int) int {
+	currentSum := nums[0]
+	maxSum := nums[0]
+
+	for i := 1; i < len(nums); i++ {
+		currentSum = int(math.Max(float64(nums[i]), float64(currentSum+nums[i])))
+		maxSum = int(math.Max(float64(maxSum), float64(currentSum)))
+	}
+
+	return maxSum
+}

patterns/go/kadane_algorithm.go

@@ -0,0 +1,17 @@
+package patterns.java;
+
+public class KadaneAlgorithm {
+    public int maxSubArray(int[] nums) {
+        int currentSum = nums[0]; // Start with the first element
+        int maxSum = nums[0];     // Initialize maxSum with the first element
+
+        // Traverse the array from the second element
+        for (int i = 1; i < nums.length; i++) {
+            // If currentSum is negative, reset to current element
+            currentSum = Math.max(nums[i], currentSum + nums[i]);
+            // Update maxSum if currentSum is greater
+            maxSum = Math.max(maxSum, currentSum);
+        }
+        return maxSum;
+    }    
+}

patterns/java/KadaneAlgorithm.java

@@ -0,0 +1,12 @@
+class KadaneAlgorithm {
+    maxSubArray(nums) {
+        let currentSum = nums[0];
+        let maxSum = nums[0];
+
+        for (let i = 1; i < nums.length; i++) {
+            currentSum = Math.max(nums[i], currentSum + nums[i]);
+            maxSum = Math.max(maxSum, currentSum);
+        }
+        return maxSum;
+    }
+}

patterns/javascript/kadaneAlgorithm.js

@@ -0,0 +1,10 @@
+class KadaneAlgorithm:
+    def max_sub_array(self, nums):
+        current_sum = nums[0]
+        max_sum = nums[0]
+
+        for i in range(1, len(nums)):
+            current_sum = max(nums[i], current_sum + nums[i])
+            max_sum = max(max_sum, current_sum)
+        
+        return max_sum

patterns/python/kadane_algorithm.py

@@ -0,0 +1,12 @@
+class KadaneAlgorithm {
+    maxSubArray(nums: number[]): number {
+        let currentSum: number = nums[0];
+        let maxSum: number = nums[0];
+
+        for (let i = 1; i < nums.length; i++) {
+            currentSum = Math.max(nums[i], currentSum + nums[i]);
+            maxSum = Math.max(maxSum, currentSum);
+        }
+        return maxSum;
+    }
+}