Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem (Q1071509)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3940722
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem |
scientific article; zbMATH DE number 3940722 |
Statements
Performance evaluations of recursive and iterative algorithms for the Towers of Hanoi Problem (English)
0 references
1986
0 references
A theorem concerning the relation between the Towers of Hanoi and the binary numbers is proven in this paper. From this theorem, an algorithm for the Towers of Hanoi problem follows. The performance evaluations of all existing recursive and iterative algorithms for the Towers of Hanoi problem show that the above iterative algorithm is the most efficient one in terms of time and space. Finally, it is shown that the binary representation of numbers completely characterizes the status of all n discs in each step.
0 references
recursive algorithms
0 references
analysis of algorithms
0 references
binary numbers
0 references
iterative algorithm
0 references
0.855432391166687
0 references
0.8372554779052734
0 references
0.8140096068382263
0 references
0.8132023811340332
0 references
