We can generalize the maximum contiguous sum problem to two dimensions to solve the maximum contiguous...

 

Transcribed Image Text:

We can generalize the "maximum contiguous sum problem" to two dimensions to solve the "maximum contiguous rectangle problem". Given an mxn array of (positive and negative) numbers, find the largest sum of values in a (contiguous) rectangle. (a) Write down an English description of the "brute force" algorithm for the "maximum contiguous rectangle problem". One or two sentences should suffice. (b) Write down the "brute force" algorithm in psuedocode. We can generalize the "maximum contiguous sum problem" to two dimensions to solve the "maximum contiguous rectangle problem". Given an mxn array of (positive and negative) numbers, find the largest sum of values in a (contiguous) rectangle. (a) Write down an English description of the "brute force" algorithm for the "maximum contiguous rectangle problem". One or two sentences should suffice. (b) Write down the "brute force" algorithm in psuedocode.