-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
72 lines (63 loc) · 1.57 KB
/
Copy pathmain.cpp
File metadata and controls
72 lines (63 loc) · 1.57 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
#include <iostream>
using namespace std;
/*!
* \brief maximumSubarray Finds a subarray (consecutive) that has the maximum summation
* among all of the subarrays.
* \param arr The array to check
* \param start Range start index
* \param end Range end index
* \return Maximum summation
*/
int maximumSubarray(int* arr, int start, int end);
void printArray(int* arr, int n);
int main()
{
int arr[9] = {-4, 5, -2, -2, 6, -4, 3, -4, 4};
printArray(arr, 9);
int max = maximumSubarray(arr, 0, 8);
cout << "Max sum subarray: " << max << endl;
return 0;
}
int maximumSubarray(int *arr, int start, int end)
{
if (start == end)
return arr[start];
int mid = (start + end) / 2;
int l = maximumSubarray(arr, start, mid);
int r = maximumSubarray(arr, mid + 1, end);
int maxLeft;
int temp = 0;
bool flag = true; //checks if maxLeft is initialized
for (int i = mid; i >= start; i--)
{
temp += arr[i];
if (flag || temp > maxLeft)
maxLeft = temp;
flag = false;
}
temp = 0;
flag = true;
int maxRight;
for (int i = mid + 1; i <= end; i++)
{
temp += arr[i];
if (flag || temp > maxRight)
maxRight = temp;
flag = false;
}
if (l >= r && l >= (maxLeft + maxRight))
return l;
if (r >= l && r >= (maxLeft + maxRight))
return r;
return maxLeft + maxRight;
}
void printArray(int *arr, int n)
{
for (int i = 0; i < n; i++)
{
if (i)
cout << ", ";
cout << arr[i];
}
cout << endl;
}