Sorting in capsule
A one-table snapshot of the well-known sorting algorithms: time and space complexity, stability, and when to use each.
I’m a software architect who designs and scales distributed systems, cloud-native microservices, and event-driven architectures. These days I mostly write Python and Go. Here’s my CV.
Outside work I’m building Themis, an open-source platform for tracking vulnerabilities in the software you ship. See what I’m up to now.
Here I write about data structures, algorithms, and the systems I work on. You can follow new posts through the feed, find me elsewhere, or read more about me.
A one-table snapshot of the well-known sorting algorithms: time and space complexity, stability, and when to use each.
What makes a sorting algorithm stable, and a worked example of when that guarantee matters.