Last week, we talked about two ways of classifying sorting algorithms: time complexity and space usage. This episode, we dig into two more! We explore how algorithms can be internal or external, and what "stability" means for a sorting algorithm. And we do it all with the help of cards, clovers, and a pair of Michaels. Based on Vaidehi Joshi's blog post, "Sorting Out The Basics Behind Sorting Algorithms".
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