The Algorithm

Comments

• TimelordTraveler@lemmy.today ⁨1⁩ ⁨week⁩ ago

  You joke, but I’ve actually encountered many people this standoffish about their designs in my career.

  source

  • FrostyCaveman@lemm.ee ⁨6⁩ ⁨days⁩ ago

    Yea this is quite common. People are still humans

    source
  • NoDignity@lemmy.world ⁨6⁩ ⁨days⁩ ago

    This is why I have tried to drill into junior devs that it is important to take a step back for several minutes before responding to criticism. It’s just too easy to fall into the trap of interpreting comments and suggestions on improvement as a personal attack.

    source
• zea_64@lemmy.blahaj.zone ⁨1⁩ ⁨week⁩ ago

  Yeah, I got a problem with n^{logn}, wtf is that monstrosity??

  source

  • drosophila@lemmy.blahaj.zone ⁨1⁩ ⁨week⁩ ago

    Apparently that’s (quasi polynomial time)[quora.com/Is-O-n-log-n-polynomial-or-exponential], which grows faster than polynomial but not quite as fast as exponential.

    source

    • Septimaeus@infosec.pub ⁨6⁩ ⁨days⁩ ago

      Though the artist appeared to draw η (eta) rather than n which could mean they’re using learning rate to compute the bounds of some other value. I’m more curious what y-base log they’re taking and why.

      source
• lowleveldata@lemmy.world ⁨1⁩ ⁨week⁩ ago

  You got a problem for your algorithm, professor?

  source
• Sodium_nitride@lemmygrad.ml ⁨1⁩ ⁨week⁩ ago

  A time complexity of N to the power of logN?

  I can see why someone might have a problem with that.

  source
• Septimaeus@infosec.pub ⁨6⁩ ⁨days⁩ ago

  Ah, the theory group. My people.

  source