Lecture 10

Learning objectives

After this class, you should be able to:

1. Derive upper and lower bounds on time complexities of algorithms, using integration.

Reading assignment

1. Class notes and handout.

Exercises and review questions

• Exercises and review questions on current lecture's material
  1. Using integration, derive good upper and lower bounds on the sum of the cubes of the first n positive integers.

• Questions on next lecture's material
  1. None.

---

Last modified: 7 Feb 2008