Timeline for Binary Fibonacci
Current License: CC BY-SA 3.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 17, 2020 at 9:04 | history | edited | CommunityBot |
Commonmark migration
|
|
| Apr 1, 2018 at 5:41 | history | edited | user79465 | CC BY-SA 3.0 |
added 19 characters in body
|
| Mar 31, 2018 at 18:59 | comment | added | H.PWiz |
You can replace $realToFrac y with .read.show$y for one byte
|
|
| Mar 31, 2018 at 18:25 | comment | added | user79465 | Thanks! That compensates for some of the longer functions used. I spent a while trying to find a way to implement bit-shifting in a more concise way, but came up short. | |
| Mar 31, 2018 at 17:36 | history | edited | user79465 | CC BY-SA 3.0 |
deleted 8 characters in body
|
| Mar 31, 2018 at 9:47 | comment | added | Laikoni |
Welcome to PPCG and Haskell golfing in particular! A shorter way to generate an infinite list of Fibonacci numbers is f=0:scanl(+)1f (taken from here). Functions can be anonymous, so you can drop the leading g=, see our Guide to Ggolfing Rules in Haskell.
|
|
| Mar 31, 2018 at 3:15 | review | First posts | |||
| Mar 31, 2018 at 4:00 | |||||
| Mar 31, 2018 at 3:14 | history | answered | user79465 | CC BY-SA 3.0 |