ALGORITHM 4.1-5

Nonrecursive, linear-time algorithm

Max-subarray-problem

this is intriguing for that:
first you should know :
if n=j,what’s the maximum of the subarray;
what’s the maximum of the other subarray,and you will use loop–which equals to O(n^2)

linear,but takes longer to calculate

#include "stdafx.h"
#include<iostream>

#include<stdio.h>

using namespace std;

//brute-force algorithm

int main()
{
    int n = 0, sum = 0;
    int q = 0, w = 0, e = 0, r = 0;

    cout << "this this linear\t\n";
    cout << "input the array size\n";
    cin >> n;

    int*maxarray = new int[n];
    int i = 0;
    cout << "please input array\n";
    for (; i < n; i++)
    {
        cin >> maxarray[i];
    }
    int tmp = 0,maxtmp=0;
    for (i = 0; i < rf; i++)
    {
        for (w = i + 1; w < rf; w++)
        {
            for (e = i; e < w; e++)
            {
                sum = 0;
                sum += maxarray[e];
            }
            if (w == (rf - 1))
            {
                if (sum > rfmax)
                    rfmax = sum;
            }

            if (sum > maxtmp)
                maxtmp = sum;

        }
    }
    if ((rfmax + a[j]) < maxtmp)
        cout << "the max subarray" << maxtmp << endl;
    else
        cout << "the max one" << rfmax + a[j] << endl;
    return 0;



}