Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
44 changes: 44 additions & 0 deletions Kadane's Algorithm
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
// { Driver Code Starts
#include<bits/stdc++.h>
using namespace std;


// } Driver Code Ends


// Function to find subarray with maximum sum
// arr: input array
// n: size of array
int maxSubarraySum(int arr[], int n){

// Your code here
int current=arr[0],overall=arr[0];
for(int i=1;i<n;i++){
if((current+ arr[i])<arr[i]){current=0;}
current+=arr[i];
if(current>overall){overall=current;}
}
return overall;
}

// { Driver Code Starts.

int main()
{
int t,n;

cin>>t; //input testcases
while(t--) //while testcases exist
{

cin>>n; //input size of array

int a[n];

for(int i=0;i<n;i++)
cin>>a[i]; //inputting elements of array

cout << maxSubarraySum(a, n) << endl;
}
}
// } Driver Code Ends