Day 9 discussion
Part two for me was also very slow until I, speed up the index search by providing a lower bound for the insertion. for every insertion of size "N",
I have an array lower = [null, 12, 36, ...], since from the left any time you find free space for a given size, the next time must be at an index at least one larger, which makes it close to being O(N) [assuming search for the next free space is more or less constant] instead of O(N^2), went from about 30s to 2s.
https://github.com/zogwarg/advent-of-code/blob/main/2024/jq/09-b.jq
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments