Homework 3

Details

Homework 3

Due January 26, 2006

All problems are taken from Introduction to the Design and Analysis of Algorithms.

Your work should be clear, concise, and in the order given.No scratched-out work, etc. should be present on your assignment.Illegible or messy work may result in a reduction in points. It is recommended that you learn and use some computer typesetting software (e.g. Word or LaTeX).

Section Page Problem Points
1.4 38 2 2
1.4 38 6 4
1.4 38 7¹ 9
1.4 39 10 5
Total 20

Notes:

For each, explain how to implement FindLargest, DeleteLargest, and Insert.