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!