Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Star 8 You must be signed in to star a gist
  • Fork 4 You must be signed in to fork a gist
  • Save mycodeschool/9666221e7527935d8e1d to your computer and use it in GitHub Desktop.
Save mycodeschool/9666221e7527935d8e1d to your computer and use it in GitHub Desktop.
#include<cmath>
#include<iostream>
#include<climits>
using namespace std;
int Maximum_Sum_Subarray(int arr[],int n) //Overall Time Complexity O(n^3)
{
int ans = INT_MIN; // #include<climits>
for(int sub_array_size = 1;sub_array_size <= n; ++sub_array_size) //O(n)
{
for(int start_index = 0;start_index < n; ++start_index) //O(n)
{
if(start_index+sub_array_size > n) //Subarray exceeds array bounds
break;
int sum = 0;
for(int i = start_index; i < (start_index+sub_array_size); i++) //O(n)
sum+= arr[i];
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;
}
@chai2champ
Copy link

ans = max(ans,sum) is this inbuilt function??

@mycodeschool
Copy link
Author

Yes, max is an inbuilt function. It returns larger of two values passed as argument

@makkawysaleh
Copy link

I have a question how can I return the start and the end of the maximum subarray?
Like from where it begins and ends.

@08shubhamjindal
Copy link

@chai2champ this function is not working for large constraints

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment