Recursive Hanoi Algo

[shreya10032000]

Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules:

1. Only one disk can be moved at a time.
2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack.
3. No disk may be placed on top of a smaller disk.

[Blackwidow2981]

I would like to work on this issue.Please assign this issue to me .

[pnpninja]

I would like to work on this issue.Please assign this issue to me .

[Rohanfizz]

Can you please assign this to me? I would love to contibute in different languages :-)
Peace:)

Can you please assign this to me? I would love to contribute in different languages :-)
Peace:)

[stale]

This issue has been automatically marked as stale because it has not had recent activity. It will be closed if no further activity occurs. Thank you for your contributions.

[stale]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Gitter or ping one of the reviewers. Thank you for your contributions!