| Commit message (Collapse) | Author | Age | |
|---|---|---|---|
| * | Day 10 | Tom Smeding | 2020-12-13 |
| This one is particularly nice in Haskell, since transforming the naive recursive function to a memoised, linear form was literally a matter of writing the recursion using an explicit fixpoint combinator, and then replacing the recursive call with a lazy array index. This is where laziness shines. | |||
 |
index : AOC | |
| My solutions to Advent of Code | git daemon user |
| summaryrefslogtreecommitdiff |