This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: COT5405 Analysis of Algorithms Homework 5 Due Thursday 3 December 2009, 5PM 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 be looked into. Every problem below has a page limit. Do not exceed that. And, page means one side of a page, so if we say page limit is 1 page, we mean only one side of a page. If we say that the page limit is 2 pages, then you can write on both sides of the page. If you think that the given page limit is too short, then type your answer. Any portion of the answer that exceeds the page limit is simply ignored. Each of the following 8 questions must be answered on a fresh page....
View Full Document
- Fall '08