Write a C/C++ program that implements the brute force solution to the max subarray problem in (n²).

How to Implement the recursive solution for the max subarray problem.

---------------------------------------------------------------

// file : recursive.cpp // author: ... // desc. : this file contains the entry point (and helper functions) for // the recursive max subarray problem/solution. #include

using namespace std; //-------------------------------------

//------------------------------------- void find_maximum_subarray(int A[], int N, int& bestStart, int& bestEnd, int& bestSum) { find_maximum_subarray(A, 0, N - 1, bestStart, bestEnd, bestSum); }

------------------------------------------------------------------------------------

// file : main.cpp

#include extern void find_maximum_subarray(int A[], int N, int& bestStart, int& bestEnd, int& bestSum);

using namespace std; //--------------------------------------------------------------------------- int main(int argc, char* argv[]) {

int a[] = { 1, 2, 3, 4, 5 }; int n = sizeof(a) / sizeof(a[0]);

int beststart = 0; int bestend = 0; int bestsum = 0;

return 0; }