Introduction to the Towers of Hanoi puzzle - Python Tutorial

Contents

• Introduction Introduction

  • The power of recursion

    47s
  • What you should know

    45s
  • Working with GitHub

    5m 10s
• 1. Introduction to Recursion 1. Introduction to Recursion

  • The concept of recursion

    1m 8s
  • Why recursion is important

    1m 24s
• 2. The Fundamentals of Recursion 2. The Fundamentals of Recursion

  • The ingredients of a recursive algorithm

    4m 11s
  • Recursion in action

    3m 26s
  • The factorial function: Iterative version

    3m 26s
  • A recursive factorial function

    4m 13s
  • Winding and unwinding the call stack in recursion

    6m 47s
  • Challenge: Fix the recursive algorithm

    1m 11s
  • Solution: The fundamentals of recursion

    1m 8s
• 3. Classic Recursive Algorithms in Python 3. Classic Recursive Algorithms in Python

  • Recursive Fibonacci function in Python

    5m 32s
  • Recursive sum function in Python

    5m 23s
  • Recursive greatest common divisor function in Python

    6m 7s
• 4. Practice Writing Recursive Algorithms in Python 4. Practice Writing Recursive Algorithms in Python

  • Recursive multiplication algorithm in Python

    3m 29s
  • Recursive exponentiation algorithm in Python

    3m 12s
  • String length recursive algorithm

    5m 3s
• 5. Sorting Data Using Recursion in Python 5. Sorting Data Using Recursion in Python

  • Introduction to quicksort

    4m 59s
  • Coding the quicksort algorithm in Python

    6m 27s
  • Challenge: Check your understanding of quicksort

    32s
  • Solution: Check your understanding of quicksort

    1m 30s
• 6. Data Traversal Using Recursion 6. Data Traversal Using Recursion

  • Traversing a Linked List using recursion

    7m 46s
  • Traversing a tree using recursion: Overview

    4m 54s
  • Traversing a tree using recursion: Python implementation

    5m 20s
  • Challenge: Tree traversal

    23s
  • Solution: Tree traversal

    19s
• 7. Optimizing Recursion in Python 7. Optimizing Recursion in Python

  • Memory considerations with recursive algorithms

    1m 57s
  • Memoization in Python

    7m 1s
  • Tail call optimization in Python

    3m 45s
• 8. Drawing Fractals Using Recursion in Python 8. Drawing Fractals Using Recursion in Python

  • H-tree fractal using Python Turtle graphics

    5m 22s
  • Sierpinski triangle

    5m 54s
• 9. The Towers of Hanoi: A Classic Recursive Puzzle 9. The Towers of Hanoi: A Classic Recursive Puzzle

  • Introduction to the Towers of Hanoi puzzle

    3m 15s
  • Coding the Towers of Hanoi puzzle in Python

    5m 31s
• Conclusion Conclusion

  • Recursion vs. iteration

    2m 5s
  • Conclusion

    1m