Add more tests for fibonacci #36
Merged
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.
I believe some students may be familiar with the recursive definition of the Fibonacci sequence. Instead of using the iterative version, they may come up with a solution like this for a start:
This solution will fail the test case where the input is a negative number, but with the given test case for string (
fibonacci("8")
), it will pass. They may mistakenly think that their solution suffices to cover for all string cases.However, the only time will this function fails for the string counterpart is when we attempt
fibonacci("1")
orfibonacci("2")
. This will cause aRangeError: Maximum call stack size exceeded
due to the fact that at the first iteration, the function attempts to evaluatefibonacci(0)
, which is not properly handled by this function.I would like to propose adding these two test cases to cover those writing the recursive definition of Fibonacci.