@[email protected] to [email protected] • 20 days agoO(no) You Didn’tmrshiny608.github.iomessage-square3fedilinkarrow-up118cross-posted to: [email protected]
arrow-up118external-linkO(no) You Didn’tmrshiny608.github.io@[email protected] to [email protected] • 20 days agomessage-square3fedilinkcross-posted to: [email protected]
minus-square@[email protected]linkfedilink7•20 days agoTL;DR, big-O ignores the constant factor. If you already know what that means you don’t need to read this…
minus-square@[email protected]linkfedilink4•20 days agoEh, 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.
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.