This animation shows how quicksort works. First we choose a pivot (middle element). Next, we swap
the elements in the beginning of the array with the elements in the end, until in the beginning of
the array will be only those elements, which are less or equal than the pivot; and in the end of
the array will remain only those elements, which are greater or equal than the pivot. Finally, if
in the beginning or in the end is more than one element, we repeat the whole process for those parts.
rate animations, add them among their favorites, and mark them as not working.