This animation shows an improved bubblesort algorithm. In this algorithm, we remember the
place of the last swap (ch) after each iterration. In next iteration we don't check again those
elements, which are already in sorted order (on the right from the place of the last swap).
rate animations, add them among their favorites, and mark them as not working.