Add implementation of binary exponentiation#80
Open
rahulc29 wants to merge 1 commit intoTheAlgorithms:masterfrom
Open
Add implementation of binary exponentiation#80rahulc29 wants to merge 1 commit intoTheAlgorithms:masterfrom
rahulc29 wants to merge 1 commit intoTheAlgorithms:masterfrom
Conversation
The recursion is done shallowly, therefore, if the index of exponentiation is larger than 2 ^ 1000, this can cause a stack-overflow.
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
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
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.
Binary Exponentiation allows for the computation of very high powers of numbers in O(log(n)) time complexity where n is the index of exponentiation.
Added :
Int,LongandBigInteger