Assignment 01 - max Aj-Ai

Assignment 01 - max Aj-Ai - write up your answers...

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 1 Assigned: 6/9/07 Due Date: 4pm, 18/9/07 Question 1 : Let A [] be an array of positive integers. Design a divide-and- conquer algorithm for computing the maximum value of A [ j ] - A [ i ] with j i . Analyze your algorithm. Notes : You can discuss homework question with your classmates, but you must
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: write up your answers independently. Acknowledge the people with whom you have discussed the assignment. All assignments should be submitted to the assignment collection box for COMP271 outside room 4213A by the due date and time. 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