Bubble sort, selection sort, and insertion sort are all
O(n2)
As we will see later, we can do much better than this
with somewhat more complicated sorting algorithms
Within O(n2),
Bubble sort is very slow, and should probably never be used
for anything
Selection sort is intermediate in speed
Insertion sort is usually the fastest of the three--in fact, for
small arrays (say, 10 or 15 elements), insertion sort is faster
than more complicated sorting algorithms
Selection sort and insertion sort are “good enough” for
small arrays