bogosort my beloved

seen from United States

seen from Malaysia
seen from United States
seen from United States
seen from South Africa

seen from Australia
seen from United States

seen from United States
seen from Yemen
seen from Germany

seen from Bolivia
seen from Kazakhstan
seen from United States
seen from United States
seen from United States
seen from United States

seen from United States
seen from Japan
seen from Russia
seen from Germany
bogosort my beloved

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
“you’re my dream girl”
Here are some monkeys based on some sorting algorithms. Algorithms are sets of rules that can be ordered to a computer to do a task, and sorting ones aim to sort a list in order. One of the less effective sorting algorithms is called the Bogosort which selects random permutations until the list happens to be sorted, similar to the Infinite Monkey Theorem where infinitely banging a keyboard randomly might write out anything eventually. One of the more effective sorting algorithms is called the Quicksort which uses a binary search tree, a structure that splits things into two paths. Groups are split into two around a random member of the list (now called a pivot) and then determined whether another member comes before or after it. In these two new groups, the same logic is applied as a new pivot member in that subgroup is selected. This repeats until everyone has been sorted.
Monbogo (Normal): Monbogos do not like to stay still as they use their paws to randomly hit or reorder anything they see. Monbogos like to press Compupa's buttons relentlessly, and rarely, they can make the Compupa speak like a human.
Atelgo (Normal/Bug): Atelgos are known for their organization as they make their livings spaces clean and organized. They often have very little patience towards cluttered messes as they use all of their limbs to efficiently tidy them.
bogosort is probably one of the most ridiculous algorithms, like imagine if you had to sort out thousands of items and bogo sort is literally the thought of "nah i ain't doing that shit" and just randomizing it until it's correct. Purely the laziest of sorting algorithms
all programmers know that quantum bogosort is the best sorting algorithm

Anya is live and ready to show you everything. Watch her strip, dance, and perform exclusive shows just for you. Interact in real-time and make your fantasies come true.
Free to watch • No registration required • HD streaming
Instead of a popularity based algorithm, all sites should show random posts through a bogosort lens. Today, I'll find a post made three days ago that changes my life. Tomorrow? A post, 19 years old, completely in Chinese. I reblog. I don't speak Chinese.
Just consumed ~30mg of indica and watched bogosort try to organize 60 items for about an hour and a half. And when it finally succeeded, I genuinely believe I spent all of the dopamine my body had in reserve for the rest of my life.
If the time for sorting and checking is negligibly infinitesimal, or even zero, would bogosort be able to sort the set of all (positive) integers? The chance of getting it each try would be 1/∞! so I guess it's possible to qualify it as a 0% chance. But if rewording it so to say that on average it'll take ∞! attempts, if they're all done in zero seconds each then surely it'd be guaranteed to happen, almost like a super-compressed supertask. And then what are the implications of this with quantum bogosort? Will there still be a universe left after, or not? Surely not more than one? Or maybe an infinite amount still? Or just none?