Can't find Waldo in your array with a fast enough time complexity? Look no further! Today I'm going to be talking about Binary Searches and how to implement them to allow you to search through your sorted arrays in no time! Well.... not in no time, but in O(logn) time! Hope you guys enjoy it. Make sure to try coding the algorithm yourself after listening to this podcast to retaining the information and resolve any misunderstandings that you may have. The best way to get better at something is by doing, so before you step in front of your interviewer at that big company, work out the iterative and recursive algorithm. As always, hope you guys have a great week! Please make sure to rate this podcast, as it helps me reach more students to educate.