Quicksort

Quicksort is an algorithm developed in 1962 by C.A.R. Hoare was developed.
It is used to sort data and, as the name itself says, this sorting algorithm impresses with its fast sorting, even with large amounts of data.
You usually choose a pivot element in the middle, the so-called turning point, and use it to divide the database into two segments.
A comparison is then made as to whether the elements in the left segment are smaller than the selected comparative element (pivot element) and the elements in the right segment are larger.
The sub-segments are then subdivided again using new pivot elements and compared with it.
This process continues until finally all segments consist of one element and thus also form a sorted sequence.
Quicksort is generally considered to be the fastest sorting algorithm.