1306

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

157 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 14 points 4 months ago* (last edited 4 months ago)

I’m more concerned about that poor stack with all those recursions.

It’s also ~~O(n^2)~~ O(n!). I’m not sure what they’re trying to do, but I’m sure it can be done in O(n) (or at least polynomial).

Reject.

this post was submitted on 28 Jul 2024

1306 points (99.0% liked)

Programmer Humor

19817 readers

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

MODERATORS