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 are asked to draw a circle flower. Animate the shape by rotating it. Notice that speed of rotation is different. Related Projects: Circle Flower