There have been multiple accounts created with the sole purpose of posting advertisement posts or replies containing unsolicited advertising.
Accounts which solely post advertisements, or persistently post them may be terminated.
ruckblack , 1 month ago It’s not like anyone cares once you have the job anyway
It’s not like anyone cares once you have the job anyway
magic_lobster_party , 1 month ago Usually the most straightforward solution is good enough. And when you want to improve the performance, it’s rarely about time complexity.
Usually the most straightforward solution is good enough. And when you want to improve the performance, it’s rarely about time complexity.
gravitas_deficiency , 1 month ago 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)
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)
Mikina , 1 month ago O(fuck)
O(fuck)
sfxrlz , 1 month ago O(unnecessary zoom meeting)
O(unnecessary zoom meeting)
xmunk , 1 month ago 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)
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 , 1 month ago Get out of my office
Get out of my office
Alienmonkey , 1 month ago 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.
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.
eager_eagle , 1 month 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⁷.”
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 , 1 month ago O(n!^n!^) It works really well, until n=3, which takes a while. Don’t ask about n=4.
O(n!^n!^)
It works really well, until n=3, which takes a while. Don’t ask about n=4.
puchaczyk , 1 month ago O(TREE(n))
O(TREE(n))
chuckleslord , 1 month ago https://i.giphy.com/KxhIhXaAmjOVy.webp
https://i.giphy.com/KxhIhXaAmjOVy.webp