4
LLMs Making Algorithms & Data Structures Obsolete (lemmy.world)
submitted 3 years ago by to c/programmerhumor@lemmy.ml
8 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 2 points 3 years ago (2 children)

Any algorithm can be O(n^2) if you only want it to be occasionally right.

  • permalink
  • fedilink
  • source
  • hideshow 4 child comments
    •
  • [–] 2 points 2 years ago

    Yes.

    And depending how occasionally we're talking, I can code for some very fast solutions when the correctness requirements are low enough.

    Alternately, if we want it to only be occasionally fast, I've got a very nice looking and very wrong algorithm for that, as well.

  • permalink
  • fedilink
  • source
  • parent