Exploring Recursion in Algorithmic Thinking
Dive into the abstract world of algorithms with a focus on recursion as demonstrated through images and illustrations. Discover the art and logic behind recursive patterns and their applications in problem-solving. This visual journey delves into the beauty and complexity of recursive structures in a clear and educational manner.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Thinking about Algorithms Abstractly Recursion Jeff Edmonds York University Lecture3 COSC 3101 1
Recursive Images if n=1 if n=0, draw n=0 else draw And recursively Draw here with n-1 2
Recursive Images if n=2 if n=0, draw n=1 else draw And recursively Draw here with n-1 3
Recursive Images if n=3 if n=0, draw n=2 else draw And recursively Draw here with n-1 4
Recursive Images if n=30 if n=0, draw else draw And recursively Draw here with n-1 5
Recursive Images if n=0 if n=1 if n=2 if n=3 if n=4 if n=5 6
Recursive Images if n=0 if n=1 if n=2 if n=3 if n=4 if n=5 7
Recursive Images = (4/3)n L(n) = 4/3L(n-1) 8
Recursive Images A Hilbert Space-filling Curve is a 1-dim line that fills a 2D plane, then a 3D cube. 9
