You should hear of the method of pretending you’re at breakfast or some other anthropomorphized situation, where you name things as butter and cheese, knife and bread, tea and teapot
Then there’s Hungarian notation which is actually used seriously. But I can’t give an entertaining example only s boring and probably inaccurate one.
Funny thing is, it’s actually not that hard to get additional volunteers for an ongoing project if you’re competent enough, only recent issues are YanDev messing up a lot of things (both his game and life) which might create some skepticism towards indie devs looking for such volunteering, and people not understanding how solo indie development works and fetishizing successes without truly understanding them.
There are subfields of computer science dedicated to this question. A good starting point for the theory would be Pessimal algorithms and simplexity analysis, which lays out two concepts:
The time & space simplexity of an algorithm indicates best-case lower bounds on resource usage, and
An algorithm is pessimal if no equivalent algorithm wastes more time/space/etc.
For example, common folklore is that sorting has O(n lg n) time complexity, depending on assumptions. In the paper, they give that sorting has Ω(n ** (lg n / 2)) time simplexity; any algorithm which takes more time, like bogosort, must do so through some sort of trickery like non-determinism or wasting time via do-nothing operations.
programmer_humor
Top
This magazine is from a federated server and may be incomplete. Browse more on the original instance.