Modified code Largest Sum Contiguous Subarray [C, Java]

largest_sum_contiguous_subarray/LargestSumContiguousSubarray.java

@@ -14,12 +14,9 @@ public static int largestSumContiguousSubarray(int[] array) {   //  maximum sum
         prevSum = array[0];						// initialize current sum amd previous sum
         currentSum = array[0];
         for (i = 1; i < array.length; i++) {
-            currentSum += array[i];				// add values in current sum
-            if (currentSum < 0) {					// if current sum is negative , make it zero
-                currentSum = 0;
-            } else if (currentSum > prevSum) {   // if current sum is greate than previous sum
-                prevSum = currentSum;             // update previous sum
-            }
+            currentSum += array[i];			// add values in current sum
+            currentSum = Math.max(currentSum, array[i]); // maximum from current sum and current array value
+            prevSum = Math.max(currentSum, prevSum);  // maximum from current sum and previous sum
         }
         return prevSum;
     }

largest_sum_contiguous_subarray/largestSumContiguousSubarray.c

@@ -6,20 +6,21 @@ int largestSumContinousSubArray(int arr[], int size) {
 	int max_int = 0;
 	for (int i = 0; i < size; i++) {
 		max_int = max_int + arr[i];
-		if(max_till < max_int) {
-			max_till = max_int;
-		}
-		if (max_int < 0) {
-			max_int = 0;
-		}
+		max_int = max(max_int, arr[i]);
+		max_till = max(max_till, max_int);
 	}
 	return max_till;
 }
 
-int main() {
-	int array[10];
-	for (int k = 0; k < 10; k++) {
-		array[k] = rand() % 10;
+int max(int first, int second) {
+	if (first < second)	{
+		return second;
+	} else {
+		return first;
 	}
+}
+
+int main() {
+	int array[] = {-2, 1, -3, 4, -1, 2, 1, -5, 4, 5};
 	printf("%d", largestSumContinousSubArray(array, 10));
 }