Save this video free

Python (Fall 2026) Module 13-1: Introducing Recursion

Bill Moseley, Ph.D. - Computer Science Educator · 8:21 · Watch on YouTube

Python (Fall 2026) Module 13-1: Introducing Recursion Watch on YouTube →

Overview

Bill Moseley introduces recursion as a function calling itself, a technique that can solve problems in ways that are sometimes simpler and less error-prone than nonrecursive alternatives. Fractals, Romanesco broccoli, a turtle-drawn branching tree, and the dream-within-a-dream structure of Inception illustrate self-similarity, recursive calls, and the need for an end case.

Key takeaways

Chapters

0:00 Why Recursion Matters in Advanced Programming
1:50 Fractals Show Self-Similar Patterns at Different Scales
5:03 Turtle-Drawn Trees, Inception, and the Recursive End Case

Keep these chapters and the full searchable transcript in your own library.

Transcript excerpt

0:04 All right, welcome back everyone. Happy Wednesday.  Today we are doing our last one-day module, and the good news is that today's module does not  carry an assignment with it. It's just a sandbox. The reason for that is because the topic  for today is somewhat obscure. However, if you are majoring in computer science, or plan  to major in computer science, or plan to do any sort of advanced mathematical explorations, data  science, or any sort of advanced programming, this can come in very handy. So for some of you, this  will just be sort of a, that's kind of interesting module. For others of you, this will be something  that you will return to later on if you're in

1:01 computer science. Recursion is somewhere between a  mathematical concept and a computer science tool. But it's a code structure, and it's a, it's a way  of doing things that is rarely required. What I mean by that is that in almost every case where  you might use recursion to solve a problem, you could do it another way. You could do it another  way. Now, in some cases, those other ways of doing things that are not recursive are a lot more work,  a lot more difficult, and more prone to errors. This is a visual example of recursion.  For those of you that are interested

1:56 in mathematical concepts, you might recognize  this image. Anybody know what this is called? So, no math nerds in here. I see. Okay, that's  fine. We can be, there are nerds of all kinds. This is called a fractal. Have you heard the  term? Probably somewhere. This is a fractal image. And what makes it a fractal image is  that it's a design that is made up of smaller versions of itself. Now, if you look at this  for a second, you can probably make sense of

This is the start of the transcript. Save this video free for the whole transcript, searchable and time-coded.

Related notes

Summary, takeaways, and chapters were generated by AI from the video's transcript and may contain errors. The video belongs to its creator, Bill Moseley, Ph.D. - Computer Science Educator.

Want the full transcript?

Save this video in YouTube Collector to get its complete searchable transcript, your own AI summaries, and a library that keeps every video you collect in one place.