423f11-hw2

423f11-hw2 - CMSC 423 Homework #2: Due: Oct. 6th at the...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CMSC 423 Homework #2: Due: Oct. 6th at the start of class You may discuss these problems with your classmates, but you must write up your solutions inde- pendently , without using common notes or worksheets. You must indicate at the top of your homework who you worked with. Your write up should be clear, concise, and neat. You are trying to convince a skeptical reader that your algorithms or answers are correct. Messy or hard-to-read homeworks will not be graded. 1. A monotonically increasing subsequence of a sequence of n integers c 1 ,...,c n is a subset of the integers c i 1 ,...,c i k such that c i 1 < c i 2 < ··· < c i k and i 1 < i 2 < ··· < i k . In other words, it is a subsequence of the input that is always increasing when considered in the order present in the input. For example: 50 , 75 , 100 is the longest increasing subsequence of input 80 , 50 , 75 , 35 , 100. Give an O ( n 2 ) dynamic programming algorithm to find the longest monotonically increasing subse- quence of a given set
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/13/2012 for the course CMSC 423 taught by Professor Staff during the Fall '07 term at Maryland.

Ask a homework question - tutors are online