170
you are viewing a single comment's thread
view the rest of the comments
[-] _taem@discuss.tchncs.de 16 points 1 day ago

I'm not a native speaker, but would agree that it sounds imprecise. To my understanding, that's a polynomial reduction of the time (O(n^2) to O(n): quadratic to linear) and not an exponential speed-up (O(2^n) to O(n): exponential to linear). 🤷 Colloquially, "exponentially" seems to be used synonymously to "tremendously" or similar.

[-] Giooschi@lemmy.world 6 points 20 hours ago

and not an exponential speed-up (O(2^n) to O(n): exponential to linear)

Note that you can also have an exponential speed-up when going from O(n) (or O(n^2) or other polynomial complexities) to O(log n). Of course that didn't happen in this case.

[-] kureta@lemmy.ml 1 points 13 hours ago
this post was submitted on 08 Jun 2025
170 points (98.3% liked)

Programming

20694 readers
253 users here now

Welcome to the main community in programming.dev! Feel free to post anything relating to programming here!

Cross posting is strongly encouraged in the instance. If you feel your post or another person's post makes sense in another community cross post into it.

Hope you enjoy the instance!

Rules

Rules

  • Follow the programming.dev instance rules
  • Keep content related to programming in some way
  • If you're posting long videos try to add in some form of tldr for those who don't want to watch videos

Wormhole

Follow the wormhole through a path of communities !webdev@programming.dev



founded 2 years ago
MODERATORS