In a previous project called massive chasing game, you simulated a game where you created 100 turtles and each turtle chase the next one and the last turtle chase the
In a previous project called massive chasing game, you simulated a game where you created 100 turtles and each turtle chase the next one and the last turtle chase the
Merge Sort algorithm is fast but it requires additional array and additional copying. Quick Sort is even faster than Merge Sort. Implement Quick Sort algorithm and animate it! Here is
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
Generate 50 random numbers and draw them as bars. Following the steps of selection sort algorithm and redraw the bar every single step to show how bubble sort works. Compare
Generate 50 random numbers and draw them as bars. Following the steps of insertion sort algorithm and redraw the bar every single step to show how bubble sort works. Compare
Generate 50 random numbers and draw them as bars. Following the steps of bubble sort algorithm and redraw the bar every single step to show how bubble sort works.
Develop the Asteroids Game with Python Turtle. Because this project is fairly large, you may want to use Object Oriented Programming by defining several classes and put them in separate
Knowing how to find the closest point on a line segment to another point, animate randomly moving line segments and circle. Color the lines in different colors when they intersect
In a previous Hypotrochoid project, you drew curves with two circles with one rolling inside the other. Expand the project by adding one more layer of circles. The following is
Simulate the explosion effect with Python Turtle.