S3:E3 - "Making brownies with depth-first search"

How are algorithms related to brownies? And how do we navigate through the nodes of a tree when implementing depth-first search? Vaidehi and Saron break it all down one chocolatey step at a time. Based on Vaidehi Joshi's blog post, "Making brownies with depth-first search". A huge thank you to Twilio for sponsoring this season of the show!

Twilio

With Twilio, your app can send text messages and make phone calls with just five lines of code. Get a promocode for $20 in free Twilio credit, along with a link to a quickstart guide for your favorite language, by texting your name to 480-485-4321.

We're on Patreon!

If you like the show and want to support our work, become a patron here. You'll get stickers, postcards, and even socks. Let's make computer science more accessible!

Vaidehi Joshi (co-host)

Vaidehi is a writer and an engineer at Tilde, where she works on Skylight. She's the creator of basecs, a weekly writing series that explores the fundamentals of computer science.

Saron Yitbarek (co-host)

Saron is a developer, podcaster, founder of CodeNewbie, and host of the CodeNewbie Podcast.

CodeNewbie

CodeNewbie is the most supportive community of programmers and people learning to code. They produce the CodeNewbie Podcast and the annual Codeland conference. Follow them on twitter @CodeNewbies. For more info, checkout www.codenewbie.org

Episode source