CS 157 : Assignment 4 Douglas

This write-up presents the design and analysis of several algorithms for determining the maximum sum of certain subsets of one-dimensional arrays. In the first section, we consider the Maximum Subsequence Sum (MSS) problem: given an array A with signed integer elements, find a contiguous subarray with the maximum possible sum. In Section 2, we extend our algorithm to handle the case of cyclic shifts of the array elements. Finally, in Section 3 we consider the Maximum Nonconsecutive Sum (MNCS) problem. For this task, we find a subset of array elements (none of which are contiguous) which achieve the maximum possible sum.