Lecture #2: Two Sample Problems in Analysis

Maximum contiguous subsequence sum

References see the Weiss textbook, pages 113-120

 

Lecture #2: Two Sample Problems in Analysis

Maximum contiguous subsequence sum

	References
	Getting Weiss' code the code from the text is available at the following URL: http://www.cs.fiu.edu/~weiss/dsj/code/Chapter05/MaxSumTest.java

 

Lecture #2: Two Sample Problems in Analysis

Maximum contiguous subsequence sum

	References
	Getting Weiss' code
	Problem specification Given: a (one-dimensional) array A of integers, of length n Find: the start and end indices and sum value for that subsequence A[i] ... A[j] which has the maximum sum relative to all such (contiguous) subsequences

 

Lecture #2: Two Sample Problems in Analysis

Maximum contiguous subsequence sum

	References
	Getting Weiss' code
	Problem specification
	Special cases I clearly the problem degenerates when there are no negative entries in the array Q: why?

 

Lecture #2: Two Sample Problems in Analysis

Maximum contiguous subsequence sum

	References
	Getting Weiss' code
	Problem specification
	Special cases I
	Special cases II Another degenerate case is when all the items in the array are negative Q: what should the answer be in this case?