Lecture 22: 03/19/2012

Welcome back everyone.

Today we reviewed what we talked about during the last lecture. If you recall, the only thing left was for us to prove the O(log n) bound on each of the treap operations, so we started that proof today.

Take a look at the rest of the proof in Kozen and we’ll wrap it up Wednesday, so bring any questions you have to class.

Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s