Efficient Solution to the Tower of Hanoi Problem Using Iteration
Published: 14 February 2023| Version 2 | DOI: 10.17632/wnm34k839k.2
Contributors:
jennifer kittur, Description
It is a code that uses iterative approach to solve the Tower of Hanoi Puzzle instead of using recursion. The iterative implementation reduces the overhead of recursive function calls and potentially result in faster execution times for larger numbers of disks.
Files
Steps to reproduce
We have used the concept of iteration to solve the tower puzzle. The code is written in C language. The code can be reproduced and used by copying from the folder and running in a C compiler.
Institutions
University of Embu
Categories
Analysis of Algorithms, Data Structure, Algorithmic Efficiency