This repository was archived by the owner on Oct 10, 2022. It is now read-only.
Tower of Hanoi #200
Open
Tower of Hanoi #200
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Contributor
|
@aryanayush012 Can you synchronize this branch with |
|
It will be now be reviewed manually. Thanks for contributions. If you have more concerns, you may get the conversation started at our discord server |
Sign up for free
to subscribe to this conversation on GitHub.
Already have an account?
Sign in.
2 participants
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Tower of Hanoi #98
in this approach we use recursion and take the help of the auxilary rod to move all the discs from
one rod to another
our refrenced auxilary rod changes everytime and we call the function recursively.
Time complexity: O(2^N)
Auxiliary Space: O(N)