Description

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.

Show Notes

This episode of the Basecs podcast is based on Vaidehi's blog post, Sorting Out The Basics Behind Sorting Algorithms from her basecs blog series.

Thank you for supporting the show!

Get a promocode for $20 in free Twilio credit and a quickstart guide for your favorite language.

Text your name to 480-485-4321.

The easiest cloud platform to deploy, manage, and scale applications of any size.

Try it for free with a $100 credit.

Thank you for supporting the show!

Get a promocode for $20 in free Twilio credit and a quickstart guide for your favorite language.

Text your name to 480-485-4321.

The easiest cloud platform to deploy, manage, and scale applications of any size.

Try it for free with a $100 credit.