Create multiple implementations of the Fibonacci function with tests and benchmarks #2
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.
This PR implements multiple approaches to calculating Fibonacci numbers, each demonstrating different algorithmic strategies and performance characteristics.
Implementations Added
1. Recursive - O(2^n) time complexity
2. Iterative - O(n) time, O(1) space
3. Memoized Recursive - O(n) time and space
4. Dynamic Programming - O(n) time and space
5. Matrix Exponentiation - O(log n) time
Features
Performance Results
The benchmark shows dramatic performance differences:
Project Structure
This demonstrates how algorithmic choices dramatically impact performance, from exponential time complexity in the naive recursive approach to logarithmic time in the matrix exponentiation method.
Fixes #1.
💡 You can make Copilot smarter by setting up custom instructions, customizing its development environment and configuring Model Context Protocol (MCP) servers. Learn more Copilot coding agent tips in the docs.