The Wayback Machine - https://web.archive.org/web/20201103184445/https://github.com/TheAlgorithms/Java/pull/1363
Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

format code #1363

Merged
merged 1 commit into from Jul 30, 2020
Merged

format code #1363

merged 1 commit into from Jul 30, 2020

Conversation

@shellhub
Copy link
Member

@shellhub shellhub commented Jul 11, 2020

No description provided.

@shellhub
Copy link
Member Author

@shellhub shellhub commented Jul 11, 2020

@yanglbme please review. thanks

@shellhub shellhub requested a review from yanglbme Jul 11, 2020
@@ -5,16 +5,13 @@
class TowerOfHanoi {
public static void shift(int n, String startPole, String intermediatePole, String endPole) {
// if n becomes zero the program returns thus ending the loop.
if (n == 0) {

This comment has been minimized.

@AnupKumarPanwar

AnupKumarPanwar Jul 16, 2020
Member

Why are you removing the base case?

This comment has been minimized.

@shellhub

shellhub Jul 19, 2020
Author Member

recursion function will be terminated when if (n != 0 ) failed

@shellhub shellhub merged commit 2890797 into TheAlgorithms:master Jul 30, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Linked issues

Successfully merging this pull request may close these issues.

None yet

2 participants
You can’t perform that action at this time.