this post was submitted on 22 Jun 2024

172 points (97.8% liked)

Programmer Humor

19423 readers

55 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

Keep content in english
No advertisements
Posts must be related to programming or programmer topics

founded 1 year ago

MODERATORS

Feyter@programming.dev

anzo@programming.dev

BurningTurtle@programming.dev

pylapp@programming.dev

172

Not everything can be done in constant time, that's O(k) (sh.itjust.works)

submitted 4 months ago by alphacyberranger@sh.itjust.works to c/programmer_humor@programming.dev

28 comments fedilink hide all child comments

you are viewing a single comment's thread
view the rest of the comments

[–] magic_lobster_party@kbin.run 19 points 4 months ago (1 children)

You have two lists of size n. You want to find the permutations of these two lists that minimizes a certain distance function between them.

[–] catastrophicblues@lemmy.ca 2 points 4 months ago (1 children)

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 4 months ago

It's essentially the traveling salesman problem