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: COT 5405 Fall 09 Homework 2 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 descrip- tion 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. Ab- solutely no pseudo-code without any English description preceding that would be accepted. For knowing what pseudo-code is, please go to the class website....
View Full Document
This note was uploaded on 01/15/2012 for the course COT 5405 taught by Professor Ungor during the Fall '08 term at University of Florida.
- Fall '08