Lecture 4: 01/23/2012

Today’s lecture was about 3SUM as well as the two easier problems (Set Intersection and Search in a Doubly Sorted Array). We discussed ideas for finding good bounds for 3SUM. We talked a bit about Binomial Heaps at the beginning.

*Remember the HW is due Wednesday.

Also, there’s a new homework assignment for next week:
Construct a min-heap in O(n) time.

We’ll start with Binomial Heaps on Wednesday so try to review the lecture in Kozen before the next class.

Good luck guys!


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 )

Google+ photo

You are commenting using your Google+ 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 )


Connecting to %s