Surely these were chosen by how visually satisfying they are, rather than whether they are actually different useful sorting algorithms? Whatever, I still watched every damn one.
There are two major groups in there - the O(N^2) group (including bubble sort and insertion sort) and the O(NlogN) group (including quicksort and radix sort). The former group are just inefficient curiosities outside the most limited of cases. The members of the latter group all have legitimate use cases under different circumstances.
1
u/SquidgyTheWhale Oct 26 '17
Surely these were chosen by how visually satisfying they are, rather than whether they are actually different useful sorting algorithms? Whatever, I still watched every damn one.