The Quicksort Algorithm

A sorting technique revolving around dividing and conquering, the Quicksort algorithm is a popular sorting algorithm often used for sorting numbers and objects from any custom class. Before we present the first code snippet using Python 3.6, we need to know one more thing about the Quicksort algorithm: it’s of an average time complexity. This time complexity is represented by the Big O notation, $O(N \space log N)$.

Quicksort in Python

The Quicksort algorithm might initially appear intimidating for beginners, but it isn’t anymore when we understand the principles behind its asymptotic notations. Let’s see ...