Breaking News: Grepper is joining You.com. Read the official announcement!

kadanes algorithm in cpp

Friendly Flamingo answered on February 14, 2023 Popularity 7/10 Helpfulness 5/10

answer kadanes algorithm in cpp

kadanes algorithm in cpp

Comment

// C++ program to print largest contiguous array sum
#include <bits/stdc++.h>
using namespace std;
 
int maxSubArraySum(int a[], int size)
{
    int max_so_far = INT_MIN, max_ending_here = 0;
 
    for (int i = 0; i < size; i++) {
        max_ending_here = max_ending_here + a[i];
        if (max_so_far < max_ending_here)
            max_so_far = max_ending_here;
 
        if (max_ending_here < 0)
            max_ending_here = 0;
    }
    return max_so_far;
}
 
// Driver Code
int main()
{
    int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 };
    int n = sizeof(a) / sizeof(a[0]);
 
    // Function Call
    int max_sum = maxSubArraySum(a, n);
    cout << "Maximum contiguous sum is " << max_sum;
    return 0;
}

Popularity 7/10 Helpfulness 5/10 Language cpp

Source: www.geeksforgeeks.org

Tags: c++ kadanes-algorithm

Link to this answer
Share Copy Link