Draw the following fractal consists of capital ‘I’s. Source Code:
Category: recursion
Animation of Sierpinski Triangle Tree with Turtle (Source Code)Animation of Sierpinski Triangle Tree with Turtle (Source Code)
Animate the transition from Sierpinski Triangle tree to Fractal tree as shown. This project is related to Sierpinski Triangle and Fractal Tree. Source Code:
Fractal Tree with Python Turtle (Source Code)Fractal Tree with Python Turtle (Source Code)
Draw the following fractal tree with recursion. This project is related to Sierpinski Triangle Tree. Source Code:
Sierpinski Triangle Tree with Python and Turtle (Source Code)Sierpinski Triangle Tree with Python and Turtle (Source Code)
Use recursion to draw the following Sierpinski Triangle the similar method to drawing a fractal tree. Source Code:
AI Tic-Tac-Toe with Minimax Tree (Source Code Included)AI Tic-Tac-Toe with Minimax Tree (Source Code Included)
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
24 Game Solver with Python Turtle (Source Code Included)24 Game Solver with Python Turtle (Source Code Included)
24 Game is a mathematical puzzle that make 4 numbers make evaluate to 24 with basic arithmetical operators ( +, -, ×, ÷). For example, given 4 numbers 1,5,5,5, we
Triangle Snowflakes (with Source Code)Triangle Snowflakes (with Source Code)
Draw the following shape of triangles with recursion.
Square Snowflake with Python Turtle (Source Code)Square Snowflake with Python Turtle (Source Code)
Draw the following square snowflake with recursion. Source Code:
Quick Sort Animation with Python and Turtle (with Source Code)Quick Sort Animation with Python and Turtle (with Source Code)
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
Merge Sort Animation with Python and Turtle (with Source Code)Merge Sort Animation with Python and Turtle (with Source Code)
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