Programmer Humor

19572 readers

1838 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

[email protected]

400

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

submitted 4 months ago by [email protected] to c/[email protected]

28 comments fedilink hide all child comments

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

[–] [email protected] 36 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.

[–] [email protected] 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?

[–] [email protected] 7 points 4 months ago

It's essentially the traveling salesman problem