Soritng Algorithm

Selection sort
go through the rest of the list and take the next smallest value.

Insertion sort
Take the next value and insert it where it belongs in the already sorted area.
Quick sort
Choose a value, put all of the larger values to the right and smaller values to its left. Repeat this for smaller subsets of the list.
Merge sort
Sort smaller sections of the list and merge the sorted sections together.
Heap sort
Put the elements into a heap structure (each color represents a level of the heap, which is organized like a binary tree). Repeatedly pop the first (and largest) element off and add it to the sorted section.
Radix sort (LSD)
Start by organizing each element by its least significant digit, and work up digit by digit.
Radix sort (MSD)
Start by organizing each element by its most significant digit, and work down digit by digit.
std::sort
Roughly sort the list with a quick sort, then put each subsection into a reverse heap, then use insertion sort to finish. Also known as introsort.
std::stable_sort
Pretty much a modified merge sort. It’s “stable” because it would keep the order of duplicate values.
Shell sort
Similar to insertion or bubble sort, but items are exchanged by larger gaps that decrease with each pass.
Bubble sort
Only adjacent items are switched in order. This has the effect of pushing the largest element to the end after every pass.
Cocktail shaker sort
The same as bubble sort, but the exchanges pass in both directions.
Gnome sort
An extremely basic form of insertion sort that does not keep track of how large the sorted section is. It only moves by one index each step.
Bitonic sort
The list is sorted in a way that combines smaller bitonic sequences, which are composed of one increasing and one decreasing subsequence.
Bogo sort
Randomly shuffle the list until it gets sorted by chance.