O(no) You Didn’t 😱
mrshiny608.github.io
A deep dive into why real-world performance often defies Big-O expectations and why context and profiling matter more than theoretical complexity
  • FizzyOrange
    7·
    20 hours ago

    TL;DR, big-O ignores the constant factor. If you already know what that means you don’t need to read this…

    • duckythescientist@sh.itjust.works
      4·
      17 hours ago

      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.

  • m_f@discuss.onlineEnglish
    1·
    20 hours ago

    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.