Add optimized binary extended gcd algorithm #38
Conversation
This file contains 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
Optimized to use cheap shifts and adds rather than multiplications and divisions for finding the greated common divisor and Bezout coefficients.
This was referenced Jan 22, 2021
|
Much appreciation to @cuviper for their help/discussion about the impl on Zulip. |
cuviper
reviewed
Mar 21, 2022
| _hidden: (), | ||
| } | ||
| } | ||
| extended_gcd(&self, other) |
There was a problem hiding this comment.
Why doesn't this try to use the binary method?
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
Optimized to use cheap shifts and adds rather than multiplications and
divisions for finding the greated common divisor and Bezout coefficients.