Recursion

• A historical background to the word “recursion”
• A recursion example : step-by-step
• A recursive Bubblesort
• A recursive function for reading lines (from a file)
• A trace of a recursive function
• Coding Cobol: Recursion
• Fibonacci by linear recursion is better
• Fibonacci in Swift
• Fractal Brownian motion using random midpoint displacement
• Fractal patterns – Barnsley ferns
• Generating a recursive Romanesco broccoli
• Generating terrain with midpoint-displacement
• Global variables and side effects
• How to develop a recursive algorithm
• Into the depths – infinite recursion
• Julia breaks recursion!
• Julia is bad at recursion
• Learning recursion through visual patterns (i)
• Learning recursion through visual patterns (ii)
• Midpoint displacement in 2D
• Musings on why the Towers of Hanoi is hard to comprehend
• Nonsensical recursion algorithms: Stutter
• Peasant multiplication algorithm (i)
• Recursion (not) – Ackermann’s Function (iii) – stacks
• Recursion (versus iteration)
• Recursion – Ackermann’s Function (i)
• Recursion – Ackermann’s Function (ii)
• Recursion – Compound Interest (in Ada)
• Recursion – Decimal to binary
• Recursion – Fortran bends the rules
• Recursion – Fortran finally gets it!
• Recursion – implementing sum
• Recursion – Listing Unix directories in C
• Recursion – Listing Unix directories in C (alternative output)
• Recursion – local variables
• Recursion – McCarthy’s “91 function”
• Recursion – structural versus generative
• Recursion – subfactorials and double factorials
• Recursion – Sudan’s Function
• Recursion – the ALGOL60 years
• Recursion – the basics of tail recursion
• Recursion – the Pascal years
• Recursion – The Sieve of Eratosthenes
• Recursion – The Towers of Hanoi (i)
• Recursion – The Towers of Hanoi (ii)
• Recursion – The Towers of Hanoi (iii)
• Recursion – the trouble with early Fortran
• Recursion – What is a primitive recursive function?
• Recursion : An algorithm for anagrams
• Recursion and marking a rule (i)
• Recursion and marking a rule (ii)
• Recursion and Matryoshka dolls
• Recursion and problem solving
• Recursion and the human mind
• Recursion – Slowsort
• Recursion in APL
• Recursion in Python
• Recursion versus iteration
• Recursion: Permutations by interchange
• Recursive algorithm – The River Crossing puzzle
• Recursive patterns – lightning bolts
• Recursive patterns – the Cantor set
• Recursive patterns – the Sierpinski Carpet
• Recursive patterns – the Sierpinski curve
• Recursive patterns – the Sierpinski gasket
• Recursive patterns – the Koch curve (i)
• Recursive patterns – the Koch curve (ii)
• Recursive patterns – the Koch curve (iii)
• Recursive patterns – the Koch snowflake
• Removing a.out’s with a shell script
• Tail recursion – What’s so special?
• The Eight Queens Puzzle (i) – background
• The Eight Queens Puzzle (ii) – brute force
• The Eight Queens Puzzle (iii) – recursion
• The origins of Fibonacci and recursion
• The problem with Pi (i)
• The problem with Pi (ii)
• The recursive factorial began life as Algorithm 33
• The recursive nature of baking powder
• The Square-Diamond algorithm for 2D surfaces (i) – basics
• The Square-Diamond algorithm for 2D surfaces (ii) – implementation
• Weird recursive algorithms
• What is recursion?
• When not to use recursion
• Why calculating Fibonacci using binary recursion is just plain moronic
• Why does NASA not allow recursion?
• Why Python is horrible for recursion
• With recursion a problem solves itself

Visual Recursion

• Learning recursion through visual patterns (ii)
• Recursive patterns – the Cantor set
• Recursive patterns – the Koch curve (i)
• Recursive patterns – the Koch curve (iii)