Programmer Humor

22657 readers

1638 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 2 years ago

MODERATORS

[email protected]

401

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

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

27 comments fedilink hide all child comments

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

[–] [email protected] 48 points 10 months ago* (last edited 10 months ago) (7 children)

How in the hell does anyone f— up so bad they get O(n!²)? 🤯 That's an insanely quickly-growing graph.

Curious what the purpose of that algorithm would have been. 😅

[–] [email protected] 37 points 10 months ago (2 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 2 points 10 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 7 points 10 months ago

It's essentially the traveling salesman problem

load more comments (4 replies)