CIS 621 Winter 1997
Algorithms and Complexity
- Homework #1 due Wednesday, Jan.15:
- Using loop invariant, prove correctness of HeapSort (AHU, Algorithm 3.4).
- Using loop invariant, prove correct procedure BuildHeap (AHU, p.90).
- Solve problem 3.18 (AHU, p.104)
- HW#1 Solutions
Send questions about solutions to Roy
- Homework #2 due Wednesday, Jan. 22
Exercises: 2.26, 2.28, 2.29, 2.31, 2.33 (AHU, pp.73-74)
- Homework Assignment #3
due: Wednesday, February 5.
- Homework Assignment #4
due: Wednesday, February 26.
- Homework Assignment #5
due: Monday, March 10.