Improved insertion sort
This animation shows an improved insertsort algorithm. First, we copy every element to a temporary
(tmp) variable. Next, we move the sorted, green part of the array to the right until we find the place
of the removed element. Finally, we put back the removed element from tmp to its right place.
rate animations, add them among their favorites, and mark them as not working.