• MajorHavoc
    link
    fedilink
    arrow-up
    4
    ·
    2 months ago

    Write more robust code.

    Sure, I could read a book about best practices and Big O…but…What if we just table the idea for a few iterations of Moore’s Law instead?

    • uis@lemm.ee
      link
      fedilink
      arrow-up
      2
      arrow-down
      1
      ·
      2 months ago

      and Big O

      It’s asymptotic. Slower O doesn’t mean faster program.

      • MajorHavoc
        link
        fedilink
        arrow-up
        4
        ·
        2 months ago

        wat.

        When I say Big O, I’m talking about the slick jazzy anime about rejecting true love and living with heartbreak because we believe a lie about our own superiority. This is always true, no matter what the discussion context. If I happen to say anything remotely relevant to mathematical Big O, that is just a deeply weird coincidence.

      • MajorHavoc
        link
        fedilink
        arrow-up
        1
        ·
        2 months ago

        Oh! You meant Moore’s Law is asymptotic!?

        Yes! That is key to the joke I was making.