A ‘real’ O(1) sorting algorithm 🤣
You must log in or register to comment.
So… … a sorting algorithm that uses a wankton of energy and gets the sort order wrong sometimes. Um… why, though?
Because bogo sort isn’t funny enough.
Lol bogosort! There’s a term I haven’t heard in a while
I still recall to this day, one of my university tutors talking about the C fastmath compiler directive: “I do not need a computer to arrive very, very quickly at the wrong answer; I can do that myself.”
It’s good to see that with applications of modern comp-sci we have graduated to arriving very, very slowly and at great expense at the wrong answer.
i now need a web framework that will just make chatgpt calls under the hood.
Can you imagine if everything deteriorates over time to be exactly like that
Harnessing the power of fusion just so* that LLMs can generate millions of index pages every secondI was toying around with an idea for a VCS that uses LLM as a compression method, where during pushes it just asks an LLM to describe what your diff contains (what changes it makes to what files), you push that summary to the origin, and when you pull it just plops that into another llm to reconstruct the files or make the file changes.
If it wasn’t such a waste of energy, I’d find that a pretty funny random side project. Would love to see the results.
Good name.
O(n^n)
Is nice! Hao much?
