Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem

DOI10.1007/BF02253184zbMath0586.68037OpenAlexW197794601MaRDI QIDQ1071509

M. C. Er

Publication date: 1986

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253184

zbMATH Keywords

iterative algorithmanalysis of algorithmsrecursive algorithmsbinary numbers

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (3)

A linear space algorithm for solving the Towers of Hanoi problem by using a virtual disc ⋮ An iterative algorithm for the Tower of Hanoi with four pegs ⋮ A Minimal Space Algorithm for Solving the Towers of Hanoi Problem

Cites Work

• Unnamed Item
• The Towers of Hanoi Problem
• The towers of Hanoi revisited: Moving the rings by counting the moves
• The Generalized Towers of Hanoi Problem
• A Representation Approach to the Tower of Hanoi Problem
• Discussion and correspondence: A note on the Towers of Hanoi problem

This page was built for publication: Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem