Well i think pigeonhole sort is the fastest

Bogosort: hold my beer

@@cope9489 quantum bogosort: hold my beer

If you have information about your input that it is almost ordered, selection sort can be faster than quicksort for example.

@@lucasanddre Yeah I've actually read about this method used in scoreboard calculations. Although it's a very specific scenario

Wait for 2030, dude.

yea me too

Im dissapointed and my life is ruined

yeah made me unsubscribe tbh

@@johnchris3547 really unfortunate😥

Same

who asked though...

@@1R4MgMYl7a who asked for your opinion anyway

@@1R4MgMYl7a Life is about being glad they answered without you having to ask...

@@1R4MgMYl7a is asking required?

​@Impunity i don't like people who are in 4th grade. They are very not nice.

That's.. the point?

@@worltex112 not really. not at all actually

@Liam Tran yes

@@manutavano what are you talking about? What is the beeping then?

@@Caleb-fv5fp the beeping is just an extra effect to make the video cooler. This is showcasing different sorting algorithms (different ways to sort a set of numbers) implemented in Minecraft. Basically the beep goes off whenever you're making comparisons, but the point of the video really are the little vertical bars getting switched around until they form a steady slope (each bar represents a number, the smaller ones are smaller numbers and the bigger ones are bigger)

the bubble sort was the most interesting.

✂️ selection sort - the usual one you see with those algorithms with the little beeps that non programmers think are cool ↔️insertion sort - seems a bit unusual, and I didn't really look back at it for too long. I wasn't paying much attention, but I've noticed that it wasn't very quick, and I wonder why. 👞 quick sort - not much to say, it's very quick 🐚 shell sort - I don't really get what's going on here, but I think it might be taking a random unfinished part and degrading it by a bit to what it's supposed to be. if this is correct, I could see this being used on systems with low memory ⬇️ TD merge sort - again not much to say, I find it an interesting approach. ⬆️ BU merge sort - it's probably my second favorite (bubble first of course) and I find it to be an amazing (visually, not practically) subset of the merge sort ◼️ heap sort - now why are you trying to look cool like merge sort? 💧bubble sort - an interesting, yet slow algorithm to show to your friends, I wouldn't recommend using this in a program for any reason other than to look cool

Ayyyy

honestly as a programmer i like quick sort the most. i feel like anyone from my field will understand haha

also, the fisher-yates shuffle is literally like 5 lines of code (i used javascript and i'm not willing to touch javat so i donmt know how would it look in your situation)

I was waiting for it 😭

Or a glass block

@max Google it, you've had 23 minuites already. Also, hi me.

bubble coral

@@consume_arsenic What?

cyan stained glass block

lmao

Randomness

Probly cause it comes up top in google or something

what

Kinky

Enggak, lu bukan orang lu setan. Lu cuma pengen jadi orang

No

It's... sorting them.

sounds Zelda like

bogo quantum sort

othr = hadr‼️‼️😡😡 micraf = esy 😃😃😎😎😱😱🤯🤯

It's literally the exact same as any other sorting algorithm video 😂

Everything is an optimized gnome sort

it IS the optimised gnome sort. Coded a gnome sort accidentaly while programming ;D

@@rubykanima same lmao

Some of the algorithms look weird because they’re writing to an auxiliary array.

@@heledron oh ok understood.

Here’s an updated visualization: ukposts.info/have/v-deo/haaLiJyjjX6a12g.html You can see the arrays swapping roles. At first the primary array has 4 partitions, then merges into the auxiliary array with 2 partitions, then merges back into the primary array with 1 partition. So the sequence appears as 4, 1.

Wiki sort is an in place block merge sort, completely different from the regular out of place bottom up merge

Merge sort does not require to be 2 parts merged, it can be k parts merged. For example, in external memory merge sort always use k-partition for some k

Same

the object for that would have to be block.hanging_roots

might be one a them newfangled data packs

Your two passions are sorting algorithms and Minecraft???

@@deliocache2528 xd

Bogo sort*

bogo sort random everything while bozo sort swaps random item

Both bogosort and bozosort exist, and are both awful ineficient algorithms. def bogosort(list): while True: shuffle(list) if isSorted(list): return list def bozosort(list): while True: swapRandomPair(list) if isSorted(list): return list There are even worse algorithms, like Worstsort, that recursively sorts the space of permutations to find the sorted one. I don't think you can visualize an algorithm like that using this sort of visualization.

hmmm i do like the sound of this bozo swap though, maybe i should implement it

@@hectobreak8097 bogo sort has one of the best best case time complexities though!!!

omg the sounds are so funny hahaha

if you don't find them funny you have no soul :o

The funny police

Ah. I know. The contrast with the marimba….which still makes no sense. But, at least the “halfway through” part was solved. Now I just gotta figure out why it’s hilarious to me.