this post was submitted on 02 Aug 2024
366 points (97.4% liked)

Programmer Humor

35334 readers
1 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 6 years ago
MODERATORS
 
you are viewing a single comment's thread
view the rest of the comments
[–] hperrin@lemmy.world 23 points 1 year ago* (last edited 1 year ago) (1 children)

O(n!^n!^)

It works really well, until n=3, which takes a while. Don’t ask about n=4.

[–] Alexstarfire@lemmy.world 1 points 1 year ago (1 children)
[–] hperrin@lemmy.world 1 points 11 months ago (1 children)
[–] Alexstarfire@lemmy.world 2 points 11 months ago

That does seem to be a tad inefficient.