Slow Sort 

+drew b. Oh my god I'm crying. It even *sounds* paranoid and stressed in the video.

"Okay, okay, after nearly fifty thousand comparisons, the list is *finally* sorted. -I _think_ so, at least... I should check it one more time, just to be sure! ...And a second time for good measure. ...And a third time for luck. And another because _oh god please stay sorted fuck fuck fuck-"_

lol

lol

lol

lol

lol

Luck no that's when you use BOGO sort 😂

joseph jackson ew you didnt say lol

lol

+Ryan N Exactly! I'm cracking up harder over a sorting algorithm than something that was actually intended to be funny.

LMFAOOOO

Counting sort is in the corner like: "One... two... and done!"

Ryan N I'm not even a programmer and I find this hilarious lol

Ryan N I've never programmed anything and I find this funny.

This is the best way to describe it

meanwhile bogosort:

@@owenyin3316 the best case would be first try so its better than bubble sort

It is a sorting network, always the same comparisons for the same amount of items

@@groszak1 this is nowhere near true

DONT MAKE FUN OF BOGO SORT

scitechian Multiply and Surrender 😂😂😂😂 Tell me he got an A++++

welp I guess whoever made it got screwed over by the bogo sort, where you literally just randomly organize everything and hope they're in the right place

@@xinlidai1642 "without deliberately making things any worse"

multiply and surrender hahahahahahahahaha

@@xinlidai1642 You're forgetting about bogobogo sort. Bogo sort is only O(n x n!). In bogobogo sort, you use bogo sort to sort every sub-array of the list.

Arthur Hill first reply with 58 likes

Agree, this one is me in real life

woah thats a lotta default pfps

Icy Pengin first reply with 32 likes 77 now

Iqbal Mala who tf cares

MamboBean it's a joke man hahaha

BananaCupcake I was replying to Iqbal Mala, not the joke

MamboBean minecraft is my favorite game

Sounds like Mario music at 0:09

1:27 Time Forward! starts here))

sounds like nothing at 3:05 ecks dee

I think it's supposed to be the flight of the bumblebee

YA LIKE JAZZ?

diegofloor first reply with 70 likes

diegofloor he, I like the music for BOGO more

bogosort

because you'd use like insertion sort (or radix base 4 sort if sorting a deck of cards) by hand.

Or be and idiot and use bogo sort be throwing the cards in the air than picking them up

i agree with him? ^

Jackie Brzostek it all starts with a deck of playingcards.

@@raffimolero64 Wait, you guys aren't bubblesorting a pack of card ?

technically bogosort could be a lot faster

Yeah, bogo sort could finish on the first try.

Yes, well know, that the Best Case for Bogo Sort is O(1), but the average case is O(N!). Not to mention, that the worst case is O (infinity)

@@ilmu011 averege is O((n+1)!)

@@mattia2510 In the O-notation constants are completely irrelevant. It is only supposed to describe complexity with a growing number of range. O (5) is the exact same as O (999999999999) is the exact same as O (1) The complexity is constant. Usually this is marked with O (1), you can say O (2) but it doesn't add any information about the complexity. Same with O (n+1). The N already states it's linear. The +1 doesn't give us any relevant infornation about the complexity. I could say that a certain sorting algorithm will always take a number of steps equal to the size of the array plus 100.000.000. You could say that the complexity is O (N + 100.000.000), but that doesn't change the fact that the complexity is still linear, so normally you would still only say O (n).

404_name_missing en.wikipedia.org/wiki/Joke

404_name_missing woosh

404_name_missing You failed turing test, go back to your server

This just made me laugh out loud

@404_name_missing /r/whoosh

Seeing it explains make it sound more horrible than I imagined.

it's based on the principle of multiply and surrender

i dont get it

In other words....... Music go big to smol

I thought slowsort made with threads where each threead waits as the value in the cell then put the value in another array

i am proud

youtube knows their shit

Lol best music of the century

The formula they use for the frequency is 120+1200*x², where x is from 0 to 1. In this case it's x being [1, 50]/50, which is from 0.02 to 1.

@@groszak1 ah thanks :)

I want a musical sorting algorithm.

@@GabrielsEpicLifeofGoals I'm writing a VST inspired by these videos, what exactly did you have in mind?

heading to improvise in this tuning years layer

Apparently it wasn't an accident, it was deliberately made to be seriously inefficient

@@FarmYardGamingit was

How IT* works?

Lao Tzu yes, i agree

It plays the same two 7th chords over and over, only faster everytime

I like the part from 0:31 to 1:02

MrPrzepior not me

It's sorting jazz :)

I thought that the time complexity for this one is O(n^log n)

Isn’t bogosort technically O(∞) in the worst case since it could theoretically never finish?

@@DannyDog27 Bogosort is guaranteed to finish because at least one of the random permutations it creates is the sorted array (or else it's not a truly random if it's avoiding the permutation that is sorted)

@@ahnafabdullah3342 That’s a common misconception about probability. If no one permutation is guaranteed to be the correct one, there is also no guarantee that an infinite number of random permutations will contain the correct one. That’s like saying if you flip six coins there’s absolutely going to be three heads

@@DannyDog27 Probability only makes sense when you have a variable/controllable number of events. Obviously there is no guarantee that you will have 3 heads if you flip 6 coins. But as you flip more than 6 coins, the expected number of heads will rise and the probability that you got 3 or less than 3 heads will become exponentially smaller. Similarly for a list of 100 items, once 100! number of random permutations have been generated, the probability that at least one of them should have been the correctly sorted permutation will now be significantly large and will continue to increase in size, until it becomes something 99.999999%... If you only have 100 items, but you generated 9999999! permutations (which is a lot of permutations), to say that you don't have a valid permutation by then is ridiculous. Hence it is not logical to describe the time complexity of bogo sort as O(∞). By definition an algorithm is defined to have a finite number of steps.

Fartonaut LoL

"Sort the numbers by making a ten and counting around while the merry-go-round broke down."

dude you don't know anything about common core

If a dumb education system (not necessarily Common Core IMO) were to teach a sorting algorithm it'd teach the absolute simplest variant of bubble sort (i.e. "repeatedly scan the array for out-of-order pairs and swap them until there are no more out-of-order pairs to swap").

we look the same

oh hey are you weee50 from discord?

weee50 It's also in-place, so you can sort giant arrays with this without worrying about memory. You might need to wait a year until this sorts such a giant array though...

Doruk Ayhan One could just use heapsort for that. It looks here like someone attempted to design a sorting algorithm, but either added an unnecessary step or forgot to put something out of a loop or recursive method.

It's slow, but not that slow.

0:01 - 0:30 0:58 - 1:25 1:43 - 1:56

Braden Best it's paranoid the elements might've moved when it wasn't looking...

Same. I always laugh my ass off when slowsort or bogosort comes up during my daily 40-minute sorting algorithm session

No It has paranoia

ocd would be more like swapping two integers back and forth ten times and starting over if certain completely irrelevant conditions weren't met with every swap

Well yes, it was designed to be the least efficient sorting method possible without deliberately making things worse (ergo bogo sort) and being OCD is one way to do that

It's a multiply and surrender type algorithm. It was meant as a joke.

Painting Jo I mean you could make an arbitrarily slow algorithm. Just have it run a pointless algorithm as a subroutine. Stoogesort is also pretty slow.

2 words BOGO Sort

@@ilikeoranges4 three (two) words Bogobogo sort

HowToBeAwesome _ "..." "..." "..." "..." "Okay but why"

You don't need to use quotations on that, aliens would basically think we're completely retarded if we presented this algorithm to them.

also holy fuck this is so fucking agro awesome work