Timeline for answer to Fibonacci reversed! by Neil
Current License: CC BY-SA 3.0
Post Revisions
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 21, 2016 at 13:27 | comment | added | Neil | @charlie Sorry, I always forgot about that. Fixed. | |
| Jul 21, 2016 at 13:27 | history | edited | Neil | CC BY-SA 3.0 |
added 2 characters in body
|
| Jul 21, 2016 at 12:48 | comment | added | charlie |
IMHO, if you call recursively the lambda by name, f(n,k,j+k), you should include the assignment f= and count it as +2 bytes. The rule for unnamed lambdas should not apply here.
|
|
| Jul 19, 2016 at 17:33 | comment | added | charlie |
Just distribute the log and precompute all constants...
|
|
| Jul 18, 2016 at 11:10 | history | edited | Neil | CC BY-SA 3.0 |
added 4 characters in body
|
| Jul 17, 2016 at 20:46 | history | answered | Neil | CC BY-SA 3.0 |