Lecture 21

We walked through the details of Karatsuba's multiplication algorithm and used a recursion tree to figure out its big-O running time.

Announcements

• Reminder: homework 3 is due this Friday
• Make sure to check that you have a grade in moodle for both sheets of all examlets you have taken. In particular, check that you have a grade for examlet 8, where we had some data entry issues.