In a previous project, we simulated a random walk on a 2-D plane. For this project, simulate stock price change with random walk. Start with an initial stock price. At
Python’s random library
In a previous project, we simulated a random walk on a 2-D plane. For this project, simulate stock price change with random walk. Start with an initial stock price. At
Use minimax tree search algorithm with alpha-beta pruning to write AI Tic-Tac-Toe player. You may also want to add randomness to your AI player so that it won’t play 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.
Generate a list of random numbers as the radii of circles. Sort these numbers in reverse order and draw these circles with colors from hue value 0 to 1.
Draw the Sierpinski Pentagon with Chaos Game. Work on this Sierpinski Triangle with Chaos Game first if you haven’t done so already. Hint: Try jump less than half way to