If I asked you to sit down right now and sort a list of numbers, there’s a good chance that you’d intuitively rediscover the selection sort algorithm. It’s a simple approach that can have significant performance implications. That’s why it shows up so frequently in technical interviews - even though most developers never implement sorting from scratch. In this article, Julie Kent walks us through the selection sort algorithm, builds a working implementation in Ruby, and discusses its performance characteristics. https://www.honeybadger.io/blog/ruby-selection-sort/