|
|
|
|
|
|
by angio
1255 days ago
|
|
|
I believe the way to test it is to have a property like `n in integer | fib(n+2) == fib(n+1) + fib(n)`. This is close to the naive (but obviously correct?) implementation of fib and can be used to test the optimized version of the function. You can also test that the sequence is increasing like `fib(n+2) > fib(n+1) > fib(n)`. |
|
|