15 Sorting Algorithms in 6 Minutes

Visualization and "audibilization" of 15 Sorting Algorithms in 6 Minutes.
Sorts random shuffles of integers, with both speed and the number of items adapted to each algorithm's complexity.
The algorithms are: selection sort, insertion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort (adaptive merge sort), shell sort, bubble sort, cocktail shaker sort, gnome sort, bitonic sort and bogo sort (30 seconds of it).
Which is the best algorithm for sorting?

How many sorting algorithms are there?

How do you write a sorting algorithm?

Where are sorting algorithms used?
sorting algorithms c++

sorting algorithms complexity

sorting algorithms java

sorting algorithms animation

sorting algorithms explained

best sorting algorithms

sorting algorithms pdf

sorting algorithms python
Which sorting is worst?

What are the types of sorting?
Why is sorting important?

What is sorting with example?

What is the use of sorting?