feat: Fibonacci number using Matrix Exponentiation, docs: Added documentation for Matrix Exponentiation and improve the main explanation of the Algorithms #11625
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.
… matrix exponentiation
Describe your change:
Added a new method for calculating Fibonacci numbers using matrix exponentiation to improve performance for large inputs.
Highlighted the efficiency of the matrix exponentiation approach, which runs in O(log n) time, making it the fastest method for large inputs. refer: Refer : https://www.nayuki.io/page/fast-fibonacci-algorithms#:~:text=Summary:%20The%20two%20fast%20Fibonacci%20algorithms%20are%20matrix
Updated comments to include details on performance and accuracy differences across all methods.
Add an algorithm?
Fix a bug or typo in an existing algorithm?
Add or change doctests? -- Note: Please avoid changing both code and tests in a single pull request.
Documentation change?
Checklist: