Upload 2 examples. #580
Merged
Upload 2 examples. #580
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
Update the Repo
1. hanoi_stack.wy 漢諾塔·堆棧法 Because the time complexity of the recursive method is too large and the memory is too large, wy-lang cannot handle more than 23 disks and will crash. So I wrote this program to implement the Hanoi Tower algorithm using the stack, in fact, the array. Since wy-lang do not support the JS function array.pop(), I wrote 2 functions to do the pop thing. Now this program can calculate 64 disks until the next Big Bang. LOL. 2. fibonacci_array.wy 斐氏列·數組法 Similar reasons. I improved the Fibonacci sequence program with arrays to save all numbers.
Update tab format.
|
Haha Great! Thank you so much for the new examples. |
|
Go to see what's new in Open Collective. 😁😁😁 |
|
Wow! our first backer! Thanks a lot!! :D |
Merged
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Because the time complexity of the recursive method is too large and the memory is too large, wy-lang cannot handle more than 23 disks and will crash. So I wrote this program to implement the Hanoi Tower algorithm using the stack, in fact, the array. Since wy-lang do not support the JS function array.pop(), I wrote 2 functions to do the pop thing. Now this program can calculate 64 disks until the next Big Bang. LOL.
Similar reasons. I improved the Fibonacci sequence program with arrays to save all numbers.