fast-fib #272
Open
fast-fib #272
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
|
The latest updates on your projects. Learn more about Vercel for Git ↗︎
|
pmk-g
approved these changes
Aug 16, 2024
collinjackson
force-pushed
the
@collinjackson/example-program-modifications
branch
from
d777a57
to
7a98413
Compare
duc-nx
approved these changes
Aug 16, 2024
|
Before you merge, I'll investigate why the write output doesn't print out. |
duc-nx
force-pushed
the
@collinjackson/example-program-modifications
branch
from
7a98413
to
8194945
Compare
|
I made a push that print out the output. Feel free to revert it. Very simple change. |
duc-nx
force-pushed
the
@collinjackson/example-program-modifications
branch
from
ef8295f
to
fb0013b
Compare
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.
Example program that computes a Fibonnaci sequence with a configurable n and seed values.
It's using an iterative algorithm, which is O(n) runtime, faster than the naive recursive algorithm in fib.rs, which is O(fib(n)).
The result is returned as output.