Skip to content

Added kadanes algo #643

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
kshiksatyam wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Added kadanes algo #643

Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
20 changes: 20 additions & 0 deletions Kadanes_Algorithm.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,20 @@
// This is Kadane's algo which is used to find maximum subarray sum in the given array...


#include <bits/stdc++.h>
using namespace std;

int main() {
vector<int> arr = {-2,1,-3,6,0,3,-1,2,1,-5,4};
int n =arr.size();

int mxx=arr[0];
int crr_sum=arr[0];

for (int i=1;i< n;i++) {
crr_sum= max(arr[i], crr_sum+arr[i]);
mxx = max(mxx,crr_sum);
}

cout << "Maximum subarray sum: " << mxx << endl;
}