ta1_sol - COMP 271H Design and Analysis of Algorithms 2006...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
COMP 271H Design and Analysis of Algorithms 2006 Fall Semester Tutorial 1 Solution 1. Design a linear time algorithm to solve the maximum contiguous subarray problem. Idea: Our problem is to find the sum of the maximum contiguous subarray. We will solve this problem incrementally. We define two variables: LocalMaxSum and GlobalMaxSum. We first consider an empty array, each time we add one item to the array and update the LocalMaxSum. If the updated LocalMaxSum is greater than GlobalMaxSum. We set GlobalMaxSum as the value of LocalMaxSum. The algorithm terminates until all items are being processed. Observation: (Note: Observation is just used to guide you thinking, it won’t be included in the solution. But it may help in the correctness proof.) We first consider an array with only four items. We have processed the first two items and we are now going to process the third item (the underline item). Case 1:
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/09/2010 for the course ENGLISH 1303 taught by Professor May during the Spring '10 term at HKU.

Page1 / 3

ta1_sol - COMP 271H Design and Analysis of Algorithms 2006...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online