All right. Welcome back. This is CS50 and this is the end of week five. So, up until now, whoop, rewind. What? Restart. Okay. All right. So, Oh, this is the beginning of the decline. Virtual set of doors. Hi, I'm Rob and let's get greedy. It's a me, Rob. And when in Rome, let's program as the Romans do. Let's decipher the Visionair program. And I hope you're game for a game of 15. How do we implement binary search? Let's find out. Wondering how to implement this game? Well, let's break out the staff solution. And let's hope that this solution helps put you on the road to recovery. And I hope you're ready to

pick up what I'm dropping off. Or putting down. Or Oh, shoot. Good call. Boom. Are there stocks to sell? To shells by the seashore? Uh I'm going to name them. For those of you who can't see the embarrassing mistake I just made, there it is. Attributes at What's going on? What's happening to me? Sorry, I'm a little loopy. I can't see your thumb. Yes. Oh, sorry. It's camera. That's all. Programming is hard. This is CS CS50.

Things called hash tables and linked lists, trees and tries, all tools for one's toolkit with which to solve problems more effectively. We'll take How did we not see that coming? We need outtakes now.