Forked from mycodeschool/MaximumSumSubarray_Kadane.cpp
Created
August 15, 2020 15:21
-
-
Save Sushant-1999/95efea2ed2ce0910d88b8875bc1b75fd to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include<cmath> | |
#include<iostream> | |
#include<climits> | |
using namespace std; | |
int Maximum_Sum_Subarray(int arr[],int n) //Overall Time Complexity O(n) | |
{ | |
int ans = A[0],sum = 0; | |
for(int i = 1;i < n; ++i) //Check if all are negative | |
ans = max(ans,arr[i]); | |
if(ans<0) //if Max < 0 return Max | |
return ans; | |
ans = 0; | |
for(int i = 0 ;i < n; ++i) | |
{ | |
if(sum + arr[i] > 0) | |
sum+=arr[i]; | |
else | |
sum = 0; | |
ans = max(ans,sum); | |
} | |
return ans; | |
} | |
int main(int argc, char const *argv[]) | |
{ | |
int arr[] = {3,-2,5,-1}; | |
cout<<MSS(arr,4)<<"\n"; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment