|Assignment 1||Sep 7||Sol 1|
|Assignment 2||Sep 13||Sol 2|
|Assignment 3||Sep 20||Sol 3|
|Assignment 4||Sep 27||Sol 4|
|Practice Problems 1||Not Due|
|Assignment 5||Oct 12||Sol 5|
|Assignment 6||Oct 19||Sol 6|
|Assignment 7||Oct 26||Sol 7|
|Assignment 8||Nov 2||Sol 8|
|Assignment 9||Nov 16||Sol 9|
|Assignment 10||Nov 30||Sol 10|
|Assignment 11||Dec 7||Sol 11|
The homework must be submitted by noon on the due date. Any homework turned in after this time will not be accepted.
How to present algorithms?
Students often ask about the proper way to present algorithms. Here are four rules to remember --- they are taken from a handout for C.E. Leiserson's Algorithms course at MIT.
- Describe the algorithm in English.
- Specify the algorithm as a program in pseudocode, if clarity demands it.
- Argue the correctness of the algorithm.
- Analyze the running time of the algorithm.
You must do 1, 3, and 4 when you present an algorithm in your homework; we strongly recommend that you do 2 as well.