c/programmerhumor · by alphacyberranger@sh.itjust.works · 2yO of what now 367 points · 15 comments · view on lemmy.world
15 Comments
Mikina@programming.dev · 65 pts · 2y
O(fuck)
sfxrlz@lemmy.world · 10 pts · 2y
O(unnecessary zoom meeting)
ruckblack@sh.itjust.works · 36 pts · 2y
It's not like anyone cares once you have the job anyway
magic_lobster_party@kbin.run · 29 pts · 2y
Usually the most straightforward solution is good enough. And when you want to improve the performance, it’s rarely about time complexity.
eager_eagle@lemmy.world · 34 pts · 2y
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⁷."
hperrin@lemmy.world · 23 pts · 2y
O(n!^n!^)
It works really well, until n=3, which takes a while. Don’t ask about n=4.
Alexstarfire@lemmy.world · 1 pts · 1y
Ok. What about n=5?
hperrin@lemmy.world · 1 pts · 1y
Alexstarfire@lemmy.world · 2 pts · 1y
That does seem to be a tad inefficient.
xmunk@sh.itjust.works · 21 pts · 2y
Acshually, in the context of O(N^2) N can be seen to constantly be equal to N and thus, as a constant, we can ignore it in our O analysis.
Yes, my bubble sort does run in O(1)
0x0@lemmy.dbzer0.com · 6 pts · 2y
Get out of my office
Alienmonkey@lemm.ee · 4 pts · 2y
Bubble sort? This wizard talk shall not pass.
My god, some of us can't read past select queries and v-lookup ruins.
On a Friday no less.
gravitas_deficiency@sh.itjust.works · 10 pts · 2y
We will also accept “I’ll file a ticket under the tech debt epic” (which will never get picked up unless/until it causes a prod outage/SLA violation)
puchaczyk@lemmy.blahaj.zone · 6 pts · 2y
O(TREE(n))
chuckleslord@lemmy.world · 4 pts · 2y