From 967d6d27ca47784c8d05a329fab1fe889d61c2b3 Mon Sep 17 00:00:00 2001 From: Atharva Kothawade <61343070+kothawade29@users.noreply.github.com> Date: Sat, 8 Oct 2022 02:03:59 +0530 Subject: [PATCH 1/3] maxSumaraayy --- maxSumArray | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 maxSumArray diff --git a/maxSumArray b/maxSumArray new file mode 100644 index 0000000..1da78fd --- /dev/null +++ b/maxSumArray @@ -0,0 +1,30 @@ +// C++ program to print largest contiguous array sum +#include +using namespace std; + +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; +} + +// Driver Code +int main() +{ + int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 }; + int n = sizeof(a) / sizeof(a[0]); + + // Function Call + int max_sum = maxSubArraySum(a, n); + cout << "Maximum contiguous sum is " << max_sum; + return 0; +} From 6691fb2d11e16e62d6c48cc1486e0b97b5075afd Mon Sep 17 00:00:00 2001 From: Atharva Kothawade <61343070+kothawade29@users.noreply.github.com> Date: Sat, 8 Oct 2022 02:05:14 +0530 Subject: [PATCH 2/3] maxSum --- Arrays/maxProdt | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 Arrays/maxProdt diff --git a/Arrays/maxProdt b/Arrays/maxProdt new file mode 100644 index 0000000..1da78fd --- /dev/null +++ b/Arrays/maxProdt @@ -0,0 +1,30 @@ +// C++ program to print largest contiguous array sum +#include +using namespace std; + +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; +} + +// Driver Code +int main() +{ + int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 }; + int n = sizeof(a) / sizeof(a[0]); + + // Function Call + int max_sum = maxSubArraySum(a, n); + cout << "Maximum contiguous sum is " << max_sum; + return 0; +} From 12215a3167add09f66e95b0b88b426f793febe33 Mon Sep 17 00:00:00 2001 From: Atharva Kothawade <61343070+kothawade29@users.noreply.github.com> Date: Sat, 8 Oct 2022 02:05:41 +0530 Subject: [PATCH 3/3] maxProoo --- Arrays/maxxx | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 Arrays/maxxx diff --git a/Arrays/maxxx b/Arrays/maxxx new file mode 100644 index 0000000..1da78fd --- /dev/null +++ b/Arrays/maxxx @@ -0,0 +1,30 @@ +// C++ program to print largest contiguous array sum +#include +using namespace std; + +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; +} + +// Driver Code +int main() +{ + int a[] = { -2, -3, 4, -1, -2, 1, 5, -3 }; + int n = sizeof(a) / sizeof(a[0]); + + // Function Call + int max_sum = maxSubArraySum(a, n); + cout << "Maximum contiguous sum is " << max_sum; + return 0; +}