| commit | 679dd4ebab1c501dd847889648432aad9a6777bd | |
| author | Eric Blake <eblake@redhat.com> | |
| Fri, 15 Dec 2023 15:21:31 +0000 (15 09:21 -0600) | ||
| committer | Eric Blake <eblake@redhat.com> | |
| Fri, 15 Dec 2023 15:23:56 +0000 (15 09:23 -0600) | ||
| tree | 73f322a719de85f6a91ef5965c4692c78cb9a04b | treesnapshot (tar.gz zip) |
| parent | 3633da83795b52b65bfb8d335e95af9b299c5013 | commitdiff |
day 12 part 2 fixed
D'oh. 1<<0 is a power of 2. Timing: ~130ms GNU, ~190ms POSIX.
Parsing dominates. The search for palindromes is worst-case O(n^2)
(starting n comparison cycles that each visit up to n/2 rows), but in
practice it is closer to linear (most comparisons short-circuit when
they fail on the first try).
D'oh. 1<<0 is a power of 2. Timing: ~130ms GNU, ~190ms POSIX.
Parsing dominates. The search for palindromes is worst-case O(n^2)
(starting n comparison cycles that each visit up to n/2 rows), but in
practice it is closer to linear (most comparisons short-circuit when
they fail on the first try).
| 2023/day13.m4 | diffblobblamehistory |