Sorts ran­dom shuffles of integers, with both speed and the num­ber of items adap­ted to each algorith­m’s complexity.

The algorithms are: selec­tion sort, inser­tion sort, quick sort, merge sort, heap sort, radix sort (LSD), radix sort (MSD), std::sort (intro sort), std::stable_sort (adapt­ive merge sort), shell sort, bubble sort, cock­tail shaker sort, gnome sort, biton­ic sort and bogo sort (30 seconds of it).

via panthema.net