Skip navigation

Fun fact: Towers of Hanoi

Fun fact: Towers of Hanoi: Java: Recursion
Fun fact: Towers of Hanoi: Java: Recursion

The Towers of Hanoi is a mathematical puzzle whose solution illustrates recursion. Learn about this problem and how to solve for three pegs which can hold stacks of disks of different diameters.

Resume Transcript Auto-Scroll
Skill Level Intermediate
55m 27s
Duration
30,874
Views
Show More Show Less
Skills covered in this course
Developer Programming Languages Java

Continue Assessment

You started this assessment previously and didn't complete it. You can pick up where you left off, or start over.

Start My Free Month

Start your free month on LinkedIn Learning, which now features 100% of Lynda.com courses. Develop in-demand skills with access to thousands of expert-led courses on business, tech and creative topics.

Start My Free Month