, pick out the max in
. Move max to the end in one swap. Recurse on 
. Running time is 
. , recursively sort . Then, bubble A[n] downward until it stops. Worst case
, best case on sorted list.
Several other sorts have similar asymptotic profiles to bubblesort.
From what I can tell, bubblesort usually has the worst constants, though.
, pick out the max in
. Move max to the end in one swap. Recurse on . Running time is . , recursively sort . Then, bubble A[n] downward until it stops. Worst case
, best case on sorted list.
