summaryrefslogtreecommitdiff
path: root/2015
diff options
context:
space:
mode:
authorTom Smeding <tom.smeding@gmail.com>2020-12-13 21:47:50 +0100
committerTom Smeding <tom.smeding@gmail.com>2020-12-13 21:47:50 +0100
commitd90266f905d2713c23bf3512f4bb654e8e148174 (patch)
treeda6e5681ddeeb68d8e3e1ad0ec0f4f8ad50f8c5a /2015
parent3ca5033e1ddd578dd5c6a3b0e8488751c879f10b (diff)
Day 10
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.
Diffstat (limited to '2015')
0 files changed, 0 insertions, 0 deletions