Overview of Sorting Algorithms: Quicksort

Discover one of the most efficient sorting algorithms

Introduction

Quicksort is probably the most popular sorting algorithm. In many experiments, it was shown that on average it performs better than other sorting methods like merge sort or heap sort.

Quicksort is based on the idea of recursively splitting an array into two parts: the first which contains all the elements that are less than a pivot element and the second which consists of greater elements. This procedure is called …

algorithms python quicksort sorting sorting-algorithms