CMSC 202 Computer Science II, Spring 2007, Section 010x

Lecture 24: Standard Template Library

Thursday 05/03, 2007

Up]

Assigned Reading:  19

Slides As Shown:

• Announcements, etc: [slide view] [print view]

• Big-O notation : [slide view] [print view]

Topics Covered:

• Compared the asymptotic performance of arrays vs linked-lists using Big-O notation.
• Explored binary search trees using a data structure visualization tool.
• Argued using amortized analysis that balanced binary search trees are possible.