366
O of what now (sh.itjust.works)
you are viewing a single comment's thread
view the rest of the comments
[-] eager_eagle@lemmy.world 35 points 3 months ago

at job interview

"ah sure, I'll solve it in n log(n) for you with an obscure algorithm because n² is too slow for your 1000 customers, even though there's no perceived difference for n<10⁷."

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

Programmer Humor

32561 readers
499 users here now

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

Rules:

founded 5 years ago
MODERATORS