3 ms·
I’m using AoC to learn Clojure this year. I found Day 14 part 2 to be performance-bound (the naive solution that worked fast for part 1 didn’t for part 2). I h
by sokoloff 5y ago
I’m using AoC to learn Clojure this year. I found Day 14 part 2 to be performance-bound (the naive solution that worked fast for part 1 didn’t for part 2).
I have to cycle back to it to use a smarter algorithm for part 2.
- jstx1 5y agoRight but you aren't performance bound by the language - rewriting the brute force for day 14 part 2 in C won't get you anywhere. I think that Eric tries to design the puzzles and the inputs in a way that - a well implemented smart solution runs in a reasonable time even in a slow language on a slow computer (this is what I meant by not being performance bound) - some of the exponential growth puzzles can't be realistically brute-forced even with a fast machine and a performant language (like the example you mentioned)
- sokoloff 5y agoAh. I get what you’re saying and agree strongly. I mis-read your intended (but clear enough) message the first time.