Skip to content
0:00 / 0:00

#recursion#towersofhanoi#python

Recursion 'Super Power' (in Python) - Computerphile

Computerphile

2.6M subscribers • 70 videos on Hallway

YouTube
  • Recommended by 2 people: 2 in engineering communities.
  • Presented by Professor Thorsten Altenkirch

Beginner. No background in the topic needed.

505K views7 years ago2 recommendations

Computer scienceProgramming languagesAlgorithmsPythonFunctional programming

Thorsten Altenkirch explains the concept of recursion using Python and demonstrates it with the Towers of Hanoi problem.

Recursion can be tricky to grasp. Professor Thorsten Altenkirch uses Python to demonstrate an example taken from his latest book. More on recursion: youtube.com/playlist?list=PLzH6n4zXuckrnXQ-5AfWUdnCzZOQgft1B EXTRA BITS: youtu.be/c9IH8DHDI4M Thorsten & Isaac's Python programming book: bit.ly/2p3r5IT facebook.com/computerphile twitter.com/computer_phile This video was filmed and edited by Sean Riley. Computer Science at the University of Nottingham: bit.ly/nottscomputer Computerphile is a sister project to Brady Haran's Numberphile. More at bradyharan.com

Why it's here

2 people recommend this

What people say. Recommended as a clear and accessible explanation of recursion and its advantages over imperative approaches.

u/0notin r/haskell • Recommends

On “Simplest example where you'd prefer functional vs imperative”

Numberphile recently did a video on this. Edit: I meant Computerphile, and here's the link: link to this video

u/Infinisilin r/haskell • Recommends

On “Made my first Haskell program”

Computerphile just did a great video on recursion where they solve the Towers of Hanoi problem! link to this video