mirror of
https://github.com/TheAlgorithms/C-Plus-Plus.git
synced 2026-02-11 14:36:25 +08:00
Adding Kadane Algorithm (#606)
* Adding Kadane Algorithm * std::cin and std::cout * Rename Dynamic Programming/kadane algorithm.cpp to dynamic_programming/kadane.cpp * Update kadane.cpp * Update kadane.cpp * // NOLINT
This commit is contained in:
committed by
Christian Clauss
parent
b64e8fb2e1
commit
d16ae9350b
30
dynamic_programming/kadane.cpp
Normal file
30
dynamic_programming/kadane.cpp
Normal file
@@ -0,0 +1,30 @@
|
||||
#include<iostream>
|
||||
#include<climits>
|
||||
|
||||
int maxSubArraySum(int a[], int size) {
|
||||
int max_so_far = INT_MIN, max_ending_here = 0;
|
||||
|
||||
for (int i = 0; i < size; i++) {
|
||||
max_ending_here = max_ending_here + a[i];
|
||||
if (max_so_far < max_ending_here)
|
||||
max_so_far = max_ending_here;
|
||||
|
||||
if (max_ending_here < 0)
|
||||
max_ending_here = 0;
|
||||
}
|
||||
return max_so_far;
|
||||
}
|
||||
|
||||
|
||||
int main() {
|
||||
int n, i;
|
||||
std::cout << "Enter the number of elements \n";
|
||||
std::cin >> n;
|
||||
int a[n]; // NOLINT
|
||||
for (i = 0; i < n; i++) {
|
||||
std::cin >> a[i];
|
||||
}
|
||||
int max_sum = maxSubArraySum(a, n);
|
||||
std::cout << "Maximum contiguous sum is " << max_sum;
|
||||
return 0;
|
||||
}
|
||||
Reference in New Issue
Block a user