diff options
| author | Aryadev Chavali <aryadev@aryadevchavali.com> | 2023-10-18 16:44:55 +0100 |
|---|---|---|
| committer | Aryadev Chavali <aryadev@aryadevchavali.com> | 2023-10-18 17:03:36 +0100 |
| commit | b99cda70877d5d2aeefb3cc3fdaa3b60a9755059 (patch) | |
| tree | b4522396237ef1364a09ad3690c5be605db4313a /2022/puzzle-6.lisp | |
| parent | 67fdc3157f3bd70891a0f24508534c45362df2ea (diff) | |
| download | advent-of-code-b99cda70877d5d2aeefb3cc3fdaa3b60a9755059.tar.gz advent-of-code-b99cda70877d5d2aeefb3cc3fdaa3b60a9755059.tar.bz2 advent-of-code-b99cda70877d5d2aeefb3cc3fdaa3b60a9755059.zip | |
Finished round 1 of puzzle 9
Pretty interesting, functional idioms kinda fail here as there are no
nice functions I can think of for the single-knot-execute-line
`dotimes` section. I could use tail recursion with an optimisation
but this is pretty explicit. You can compare execute-lines to
execute-line to see which type of iteration fits you.
Diffstat (limited to '2022/puzzle-6.lisp')
0 files changed, 0 insertions, 0 deletions