HW2_003 - COT5405 Analysis of Algorithms Homework 2 Due...

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

View Full Document Right Arrow Icon
COT5405 Analysis of Algorithms Homework 2 Due Tuesday 19 Feb 2008 5 PM 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 pseudocode, 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 pseudocode 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 pseudocode. Absolutely no pseudocode without any English description preceding that would be accepted. For knowing what pseudocode is, please go to the class website. Pseu- docodes 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
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the 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.

Page1 / 3

HW2_003 - COT5405 Analysis of Algorithms Homework 2 Due...

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online