{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

# HW4_002 - COT5405 Analysis of Algorithms Homework 4 Due...

This preview shows pages 1–2. Sign up to view the full content.

COT5405 Analysis of Algorithms Homework 4 Due Friday 6 November 2009, 4PM Eastern in E309. Unless otherwise specified, each time you give an algorithm, you must state and justify its complexity. You answer should begin with a high-level description of your solution in plain English, and then the pseudo-code, if necessary. The English description should convey the core idea of your proposed solution, and should include the proof of correctness (basically, showing why your algorithm works). You can even omit the pseudo-code if 1) you think your English description is clear enough to specify both the algorithm and its proof of correctness very precisely, and 2) the complexity is very much evident from your English description. We attempt to grade the answer right after reading the English description, and only in a few occasions we do look into the pseudo-code. Absolutely no pseudo-code without any English description preceding that would be accepted. For knowing what pseudo-code is, please go to the class website. Pseudo-codes that look like programs will be treated as programs only and will NOT

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 3

HW4_002 - COT5405 Analysis of Algorithms Homework 4 Due...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online