Recursion, Fractals, and the Python Turtle Module
summary
Defines recursion as breaking a problem into smaller subproblems until a trivial base case (example: factorial recursion using num > 1 and num-1) and implements fractals by recursively drawing triangles via midpoints with the Python turtle module. Shows a Sierpinski triangle rendered at four then six layers, notes sequential recursion (draw left branch down to smallest, resurface, draw next) and that higher levels multiply detail and runtime; code and slides are linked.
AI-written summary · about
chapters (5)
- 0:00Start
- 7:45Fractals display self similarity across scales
- 10:51What is the Python Turtle Module?
- 21:46Takeaways
- 22:13Have Fun with Code
related talks
05mGenerative Drawing with Python Turtle Graphics
23mThe creative art of algorithmic embroidery
01h 06mTurtles! Hill climbing! Hammers! Paper bags!
31mThe Art of Functional Programming
09mPseudofractals! Accidental aesthetics where math meets pixels
11mPlants are Recursive!!: Using L-Systems to Generate Realistic Weeds
34mDiscovering fractals with CSS.
22mGenerative Art Speedrun