T.H. Cormen, C.E. Leiserson and R.L. Rivest. Sorting and searching. Recurrence relations, Order notation. Divide and conquer, greedy methods, dynamic programming, linear programming, and inductive algorithms. There will be no programming assignments.
Assignments are due in class on the specified date.
Turn in what is completed by the deadline for partial credit. No late submissions will be accepted. All submissions must be your own work. Identical assignments will not be accepted. Regular class attendance and participation is expected and is the responsibility of each individual.