Assignment 07 - Dynamic Programming

Assignment 07 - Dynamic Programming - < 5 , 23 , 4 , 17...

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

View Full Document Right Arrow Icon
COMP 271: Design and Analysis of Algorithms Fall 2007 Assignment 7 Assigned: 1/11/07 Due Date: 4pm, 8/11/07 Question 1 : Give an O ( n 2 ) time dynamic programming algorithm to fnd the longest monotonically decreasing subsequence oF n numbers. ±or example, iF the input sequence is
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: < 5 , 23 , 4 , 17 , 12 , 45 > , then the output should be < 23 , 17 , 12 > . Notes : You can discuss homework question with your classmates, but you must write up your answers independently. Acknowledge the people with whom you have discussed the assignment. 1...
View Full Document

This note was uploaded on 10/18/2009 for the course COMP 271 taught by Professor Arya during the Spring '07 term at HKUST.

Ask a homework question - tutors are online