|
|
|
|
|
|
by eru
1252 days ago
|
|
|
In addition to what
travisjungroth said, you can also check against a reference implementation. Eg if you coded up an O(n) version of the Fibonacci calculation, you can check against the naive recursive one (or if you are feeling confident, you can check against the O(log n) solution via repeated squaring of matrices.) |
|
|