Analysis of Recursive Algorithms for Solving the Problemof the Tower of Hanoi

Eip Rufati, Burhan Rahmani, Biljana Percinkova

Abstract


This problem is well known to students of Informatics, since it appears in virtually at the introductory text on the data structure or the algorithms, this is why it‟s one of the main examples in programming, it is known as the problem of Tower of Hanoi. The recursive algorithm calls itself with simpler input values, what the algorithm does to the current input it applies simple operations to the returned value for the simpler input, and which obtains the result for the current input. Well this is why the recursive algorithm is very famous and also why we chose to solve the problem with this algorithm, we minimize the problem and then we can solve the problem easier. In this paper, we will try to solve the problem with a recursive algorithm and to analyses the recursive algorithms of it. The paper deals with the problem of Tower of Hanoi and recursive algorithm of this problem.

Keywords: Towers of Hanoi, algorithm, recursion, analysis.

Full Text:

PDF


DOI: http://dx.doi.org/10.0001/(aj).v2i6.1259

DOI (PDF): http://dx.doi.org/10.0001/(aj).v2i6.1259.g1758

Copyright © 2012-2020 ANGLISTICUM. Journal of the Association-Institute for English Language and American Studies,Tetovo, Republic of North Macedonia.

All Rights Reserved.

The publication is licensed under a Creative Commons License (CC BY) https://creativecommons.org/licenses/by/4.0/  View Legal Code                                                                                                                 

ISSN (print): 1857-8179. ISSN (online): 1857-8187.

Disclaimer: Articles on Anglisticum have been reviewed and authenticated by the Authors before sending for the publication.

The Journal, Editors and the editorial board are not entitled or liable to either justify or responsible for inaccurate and misleading data if any. It is the sole responsibility of the Author concerned.