Analysis of bubble sort
nThis algorithm represents essentially the
same number of steps as the selection sort.
nIf make a pass
through the list without interchanging, then the list is ordered. This
makes the algorithm fast if it is mostly ordered.