Quicksort in Python
Introduction Quicksort is a popular sorting algorithm and is often used, right alongside Merge Sort. It’s a good example of an efficient sorting algorithm, with an average complexity of O(nlogn). Part of its popularity also derives from the ease of implementation. We will use simple integers in the first part of this article, but we’ll give an example of how to change this algorithm to sort objects of a custom class. Quicksort is a representative of three types of sorting […]
Read more