404
Not everything can be done in constant time, that's O(k) (sh.itjust.works)
submitted 5 months ago by alphacyberranger@sh.itjust.works to c/programmer_humor@programming.dev
41 comments fedilink hide all child comments
you are viewing a single comment's thread
view the rest of the comments
[-] catastrophicblues@lemmy.ca 2 points 5 months ago

Surely you could implement this via a sorting algorithm? If you can prove the distance function is a metric and both lists contains elements from the same space under that metric, isn’t the answer to sort both?

[-] jjagaimo@lemmy.ca 7 points 5 months ago

It's essentially the traveling salesman problem

this post was submitted on 22 Jun 2024
404 points (97.4% liked)

Programmer Humor

19623 readers
1 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 1 year ago
MODERATORS
Feyter@programming.dev
anzo@programming.dev
BurningTurtle@programming.dev
pylapp@programming.dev