See sort algorithm. Quick Sorting a List This quick sort uses randomly chosen pivots (in red) to keep dividing the list into two until there is only one item on each side of the pivot left.

The algorithms on display in this video include selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort ...

We also create and publish movies that dance various sorting algorithms with folk dance. " Quick sort Movie that expresses " Quick-sort with Hungarian (Küküllőmenti legényes) folk dance ".

It then proceeds to sort the copies of that array using std::sort, regular single-threaded quicksort, followed by a number of iterations of sorting with GPU-Quicksort in OpenCL 2.0.

The sorting algorithm led to improvements that were up to 70% faster than benchmarks for shorter sequences and about 1.7% faster for sequences exceeding 250,000 elements.