//  SubArraySumTimer.cpp
//  Implement and time several algorithms for the Best 
//    Subarray Sum problem.
//  The problem instances are created randomly.

//  15 oct 04   tom bailey

//  Revisions by tom bailey   16 oct 08
//  Replaced timer with hrTimer

#include <vector>
using std::vector;
#include "RanGen.h"
#include "SASSolver.h"
#include <iostream>
using std::cout;
using std::cin;
using std::endl;
#include "hrTimer.h"
#include <ctime>

vector<double> makeArray( RanGen * rg, double lower, 
						 double upper, long n ); 

void main( ) 
{
	double const lower = -20;
	double const upper = +10;
	double const minTime = 2.0;
	RanGen * rg = new RanGen( long( time( NULL ) ) );

	cout << "How many tests, test vector size: ";
	int many;
	int size;
	cin >> many >> size;
	for( int i=0; i<many; ++i ) {
		cout << "Testing with vector of size " << size << endl;
		vector<double> test = makeArray( rg, lower, upper, size );
		for( size_t k=0; k<test.size(); ++k )
			cout << "    " << k << "  " << test.at(k) << endl;
		cout << "  from SASOne:  " << SASOne().bestSum( test ) << endl;
		cout << "  from SASFour: " << SASFour().bestSum( test ) << endl;
	}

	cout << endl << "Timing Runs:" << endl;
	while( true ) 
	{
		SASSolver & alg = getAlgorithm();
		double sas;
		cout << "Enter size: ";
		long n;
		cin >> n;
		while( n > 0 ) 
		{
			cout << endl << "Algorithm " << alg << ", "
				<< n << " items ";
			Timer watch;
			long runs = 0;
			while( watch() < minTime ) 
			{
				vector<double> instance = makeArray( rg, lower, upper, n );
				cout << ".";
				watch.start();
				sas = alg.bestSum( instance );
				watch.stop();
				runs++;
			}
			cout << endl << "Algorithm " << alg << ", "
				<< n << " items, " << runs << " runs, "
				<< watch()/runs << " seconds per run" << endl << endl;

			cout << "Enter size: ";
			cin >> n;
		}
	}
}


vector<double> makeArray( RanGen * rg, double lower, 
						 double upper, long n )
{
	vector<double> v;
	for( int i=0; i<n; ++i )
	{
		v.push_back( lower + ( upper - lower ) * rg->unif() );
	}
	return v;
}