PROGRAM #2

Fall 2009

Due: October 2, 2009, 5pm on eLearning


General Guidelines:


PROBLEM    Maximum subsequence sum problem:

For this assignment you will be comparing the performance of the four different algorithms we discussed for the maximum subsequence sum problem. Here are the details:

Report:

In a separate document (Word or PDF), compile the following sections:

·   A: Problem statement. In 1-2 sentences state the goal(s) of this exercise.

·     C: Experimental Results:  In this section, include the following:

o       The plots from the above test results

o       Are the observations made in the above plots as per your theoretical expectations? If so, why, and if not, why not? Explain.


FINAL CHECKLIST FOR SUBMISSION:

    ___  Cover sheet

    ___  A separate folder containing all your source code (including the main function you used for testing)

    ___  Report

    ___  Both the above zipped into another folder archive called Program2<YourLastName>.zip