Bogo Sort

preview_player
Показать описание
Program is Gaming32's ArrayV
Рекомендации по теме
Комментарии
Автор

1, 7M swaps
383k Comparisions

worth it

usernametaken
Автор

Remeber bogo sort can be o(1) and if you terminate the program you loose no progress, amazing algorithm

propoppop
Автор

speed of this sort depends on luck, so its theoretically fastest sort algorithm in the world

fantik
Автор

I just had a cool sort idea:
The modified Bogo sort
First, it checks if any pieces are in the right place.
Then, it randomizes every piece in the wrong position.
Repeat until everything works.
Otherwise called the Yahtzee sort.

masteroftheinternetverse
Автор

If someone doesn’t understand, bogosort just (I’m gonna analogize this, hold on) throws the information into a bag, shakes it like it owes it money, and dumps the jumbled contents of the bag into a line. Essentially, incessant scrambling

BOT_CORP
Автор

ive been messing around with python, and im trying to make a bogosort spell "dairy queen" and im struggling to get it to retry after it fails

idontknowwhywouldiknow
Автор

Must have been a bit flip caused by a cosmic ray to make Bogo sort anything.

_GhostMiner
Автор

BOGO takes several months if twelve bars

RapidFiredRooms
Автор

i had stroke for watching this video and nobody call hospital for me

L_aucs
Автор

8! ×28 (estimated swap count) is 1.12 million, so you actually got a bit unlucky (×28 because that equals one randomisation, and 8! is the amount of combinations

sethboyce
Автор

Fun fact: Every sorting algorithm is bogo sort. Just depends on luck

thermitty_qxr
Автор

Bogo Sort's Formula:
For Ex. 8 = n and N = 8!.

wowthatsreallong
Автор

Bogo sort work by check if da list is sorted
if yes -> end sorting
if no -> ramdomly shifting all the element->back to step 1

PhạmHiếu-gh