Welcome to collectivesolver - Programming & Software Q&A with code examples. A website with trusted programming answers. All programs are tested and work.

Contact: aviboots(AT)netvision.net.il

Buy a domain name - Register cheap domain names from $0.99 - Namecheap

Scalable Hosting That Grows With You

Secure & Reliable Web Hosting, Free Domain, Free SSL, 1-Click WordPress Install, Expert 24/7 Support

Semrush - keyword research tool

Boost your online presence with premium web hosting and servers

Disclosure: My content contains affiliate links.

39,938 questions

51,875 answers

573 users

How to find the maximum sum of a subarray in C

1 Answer

0 votes
#include <stdio.h>
#include <limits.h>

int maxSubArray(int arr[], int size) {
    int maxSum = INT_MIN;
    int currentSum = 0;
    
    for (int i = 0; i < size; i++) {
        currentSum = (arr[i] > currentSum + arr[i]) ? arr[i] : currentSum + arr[i];
        maxSum = (currentSum > maxSum) ? currentSum : maxSum;
    }
    return maxSum;
}

int main()
{
    int arr[] = {1, -2, 2, -3, 4, -1, -1, 2, 3, -5, 4}; // 4 + -1 + -1 + 2 + 3 = 7
    int size = sizeof(arr) / sizeof(arr[0]);
    
    printf("%d\n", maxSubArray(arr, size));
    
    return 0;
}



/*
run:

7

*/

 



answered Feb 25, 2024 by avibootz
...