Skip to content

References: Recursion and Fractals

  1. Recursion (computer science) — Wikipedia https://en.wikipedia.org/wiki/Recursion_(computer_science) Covers the foundational concept of recursion in programming, including base cases, recursive cases, and the call stack. Essential background reading for understanding how Python handles recursive function calls.

  2. Fractal — Wikipedia https://en.wikipedia.org/wiki/Fractal Explains what fractals are, how self-similar patterns repeat at different scales, and the mathematics behind famous fractals including the Koch snowflake, Sierpinski triangle, and fractal trees used in this chapter.

  3. Koch snowflake — Wikipedia https://en.wikipedia.org/wiki/Koch_snowflake Describes the Koch snowflake construction process step by step, showing how a recursive rule applied to a triangle produces an infinitely detailed boundary — directly supporting the Koch snowflake turtle program in this chapter.

  4. Think Python by Allen B. Downey (O'Reilly, free online at greenteapress.com) Chapter 5 introduces recursion with clear diagrams of the call stack, stack frames, and base cases. Downey's accessible style matches this chapter's audience and his stack diagrams help visualize what Python is doing internally during recursive calls.

  5. Python for Kids by Jason R. Briggs (No Starch Press) Introduces recursion and turtle graphics together in a style designed for younger learners, making it an ideal companion reference. The chapter on drawing with turtle reinforces the fractal projects in this chapter.

  6. Python Docs — Defining Functions https://docs.python.org/3/tutorial/controlflow.html#defining-functions The official Python tutorial section on functions explains how Python handles function calls, argument passing, and return values — the building blocks every recursive function relies on, directly applicable to the programs in this chapter.

  7. Real Python — Recursion in Python https://realpython.com/python-recursion/ A thorough, beginner-friendly walkthrough of recursive thinking in Python with diagrams showing how the call stack grows and unwinds. Includes worked examples of classic recursive problems that extend the concepts introduced in this chapter.

  8. GeeksforGeeks — Recursion in Python https://www.geeksforgeeks.org/recursion-in-python/ Provides concise code examples of recursive functions, base cases, and the Sierpinski triangle pattern. Useful as a quick reference when students want to see additional recursive patterns beyond those covered in this chapter.

  9. W3Schools — Python Functions https://www.w3schools.com/python/python_functions.asp Reviews function definition and calls with interactive Try-It examples students can run directly in the browser. Reinforces the function fundamentals that recursive programs depend on, with a format familiar and comfortable for younger learners.

  10. Programiz — Python Recursion https://www.programiz.com/python-programming/recursion Explains recursion with step-by-step call stack diagrams, worked factorial and Fibonacci examples, and clear identification of base and recursive cases — making it an excellent companion page for students who want a second explanation of this chapter's core concepts.