ta1_question

ta1_question - to a report-type problem(i.e Print out the...

Info iconThis preview shows page 1. 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 question 1. Design a linear time algorithm to solve the maximum contiguous subarray problem. Further discussion: (a) The problem we have discussed is a count-type problem. How to modify the solution
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: to a report-type problem (i.e. Print out the maximum contiguous subarray)? What is its running time? (b) Is the above algorithm optimal? 1...
View Full 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.

Ask a homework question - tutors are online