S3:E6 - "Drowning in DFS"

In our final look at depth-first search (DFS), we explore how to implement this lovely algorithm in coding terms. We also dig into Big O notation, breaking down how to determine the time and space complexity of DFS. Based on Vaidehi Joshi's blog post, "Demystifying 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 and fun!

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