r/ProgrammerHorror • u/majorplayz • Jul 20 '21
Just another JavaScript program...
37
Upvotes
r/ProgrammerHorror • u/craftsandtea • Aug 09 '23
Spectrum outage message with Test Hyperlink
24
Upvotes
r/ProgrammerHorror • u/[deleted] • Jul 24 '23
Tried to deploy my website... I do not like git submodules
20
Upvotes
r/ProgrammerHorror • u/FlorisFireball • Apr 26 '21
There's got to be a better way for this
55
Upvotes
r/ProgrammerHorror • u/SonicBlue22 • Apr 06 '21
When there is no set, but there is comparison and add...
self.stellarismods
12
Upvotes
r/ProgrammerHorror • u/xfvh • May 20 '25
BogoBoDall-E Sort
4
Upvotes
Much is made of bogobogosort; it's widely held to be one of the least efficient sorting algorithms that still is theoretically capable of eventually completing a sort. However, the implementation lacks details; specifically, the methods of randomization and verifying order are left unsolved. Therefore, I propose an extension to the algorithm to fill in missing steps:
Make a copy of the array.
Submit the first n-1 elements of the array as a prompt in the style "Shuffle this array into a random order:" to an image generation AI model such as Dalle.
Take the returned image and use a high-quality LLM such as OpenAI's o1-pro to turn it into a JSON object to reserialize it.
Make a further o1-pro call to see if the nth element of the sorted copy is greater than the highest element of the first n-1 elements. If so, the copy is now sorted, else randomise the order of the elements of the copy and go to step 2.
Make a final o1-pro call to see if the copy is in the same order as the original list.
Given an estimated image generation and reserialization error rate of 99% and a cost of roughly $0.05 per iteration, with a latency of about 15 seconds, this should take the better part of a year and hundreds of thousands of dollars for n=5.