- cross-posted to:
- programming@programming.dev
- cross-posted to:
- programming@programming.dev
You must log in or register to comment.
TL;DR, big-O ignores the constant factor. If you already know what that means you don’t need to read this…
Eh, I also enjoyed seeing the comparison between Go and Python, seeing the jumps in time because of allocations, and knowing the size of the list when the more efficient algorithm started to become faster.
It’d be interesting to see if switching to pypy made any difference. It won’t beat the eventual exponential growth, but I’ve seen it be as fast as Rust code I’ve written for code like this.
