I got sad news for you guys: this will be the last post about sorting algorithms. I know that there are a lot of sorting algorithms I did not describe (for example the super-famous Timsort). Unfortunately, the enthusiasm about this kind of post quickly reached zero, so this is all. …

As with the previous post, I’ll keep talking about sorting algorithms (NOT based on comparison) that have a linear complexity. This post, in fact, is about Radix Sort. How Radix Sort works As I said in the previous post in order to achieve a linear complexity we need more restrictive hypotheses. In this case…

With the last post, I completed the first part about sorting algorithms. In fact, I did all the sorting algorithms based on comparison (not everyone, just the ones I wanted to do). Those past algorithms were all sorting my making comparisons between the elements of the array. There is, anyway…

With the last post, I introduced Quicksort and its Python implementation. At the end of the same post I told you that I would have made an additional post about it to talk about the worst-case scenario and how to avoid poor performances. Quicksort worst-case The question I asked you at the…

We finally reached Quicksort, one of my favorite sorting algorithms and the most used in the world (until Timsort came in). Quicksort was invented in 1961 by Tony Hoare (remember the Monitor?. We should stop wasting time and let’s dive into it. How Quicksort works Quicksort is a divide and conquer algorithm. After…