| commit | 7cc14b52b81caab3e6325915e5feeaa92f5a85be | |
| author | Eric Blake <eblake@redhat.com> | |
| Wed, 10 Jan 2024 21:13:37 +0000 (10 15:13 -0600) | ||
| committer | Eric Blake <eblake@redhat.com> | |
| Wed, 10 Jan 2024 22:39:41 +0000 (10 16:39 -0600) | ||
| tree | f32d4b7941032f8e78b0204a6741f08fe682318d | treesnapshot (tar.gz zip) |
| parent | 3aafa8f6edc479f63849e16150434b51610e8d64 | commitdiff |
day 6 mention possible todo
My solution has the benefit of not needing any new math constructs;
but a binary search, even if O(log n), is still slower than solving
the quadratic equation (division and square root depend on the number
of bits being computed on; but a rough estimate would be cutting this
to O(log log n), which would feel more like O(1)).
My solution has the benefit of not needing any new math constructs;
but a binary search, even if O(log n), is still slower than solving
the quadratic equation (division and square root depend on the number
of bits being computed on; but a rough estimate would be cutting this
to O(log log n), which would feel more like O(1)).
| 2023/day06.m4 | diffblobblamehistory |