Lecture 18

Learning objectives

After this class, you should be able to:

1. Given an algorithm, analyze its amortized time complexity using (i) the accounting method, and (ii) the potential method.

Reading assignment

1. CLR: Sections 17.2 - 17.3.
2. CLR: Chapter 17, pages 590 and 604.

Exercises and review questions

• Questions on current lecture's material
  1. Exercise 17.2-2.
  2. Exercise 17.3-2.

• Questions on next lecture's material
  1. (Post your solution on the discussion board) Give a graph with six vertices, give its adjacency matrix, and show the order in which a depth first search will traverse the vertices (also mention the starting vertex).