In previous sorting animations, we animated selection, insertion, and bubble sort. They are slow O(n^2) slow sorting algorithm. Merge Sort, a divide and conquer algorithm, is a much faster sorting
In a previous project, you animated a dot to gradually light up at every a few seconds. Now make the dot move randomly as it lights up. Read tutorial on