Here are the pictures from today’s lecture. We recalled the 3SUM problem form the homework (due Wednesday, mind you) and looked at the search in a doubly sorted matrix as a hint for 3SUM. In that problem, we gave an algorithm for the upper bound and gave an argument for the lower bound. It turns out these bounds are tight.

TAs:

William MacRae: F 11:30-12:30 GHC 5208

wmacrae AT andrew

Adona Iosif: M 1:00-2:00 GHC 8221

adona.iosif AT gmail

Don’t forget to work on the homework! The comments section is a good place to start, but the TA office hours are also good.

Have a great weekend!

Advertisements