BTMC REACTS TO SORTING ALGORITHMS

Watch live at / btmc
BTMC " BeasttrollMC " Ling LIVE REACTION😔
Videos Watched:
• sorting algorithms to ...
• *SEIZURE WARNING* Push...
• 15 Sorting Algorithms ...
▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂
【Other places】
➤Main Channel: / btmclive
➤Clips Channel: / btmchighlights
➤Join my Discord : / discord
➤Follow me on Twitter : / btmclive
▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂▂
Edited by: Chompy
/ mrchompysaur

[@kaiwut]

peak btmc reaction content

[@sihamhamda47]

10:26 I'm not even surprised if someone decided to map this in osu

[@waidi3242]

it's too slow, it wouldn't worth it

[@RO_Tim]

@@waidi3242 waltz of the irish type beat

[@_wetmath_]

Ekoro would fc it on his first try

[@waidi3242]

@@RO_Tim yeah but there was some fast af mappable sounds, this would be just 4* unsynced jumps

[@sfisher923]

Considering someone did chart these Sorting Algorithms on Clone Hero so I wouldn't be surprised if some did it on mania or normal osu!

[@bite12344]

Bogo sort is literally the RNG of sorts, you either hit the best first randomisation which is the sorted list or you randomise till you hit the upper limit, I guess the average is worse than the others, but hey it could theoretically be the best, all hail RNG.

[@ryanzdral8895]

Bogo bogo sort is even better, as it uses recursion. It goes way slower on average and is even detrimented by its use of recursion, but it uses recursion. So it’s just cooler, that’s just science

[@anto_fire8534]

Quantum bogosort is the best of all algorithms, better than those 2 u mentionned.

[@polymations]

or it never manages to find the actually sorted one, which is O(infinity).

[@_Kori]

bogo sort sucks but damn does it drop some sick beats 🔥🔥🔥

[@fuyuv_]

just gotta be lucky

[@quack3891]

Sorts in the video (but written by me, so they're pretty dumb but easy to understand the premise) First, let's explain why and what O(n) is. O(n) sorts are basically non-comparison sorts, It's not that they don't "compare" but that they don't look at two elements really and then just say, "well one is bigger than the other". The reason why O(n) sorts work is because you are comparing them very very broadly. It's kinda like having a bunch of numbers from 0 to 9999. If you make a bucket of 0 to 999. Then it's still a large list, but at least you know its 0 to 999. Then to 0 to 99, then to 0 to 9. The reason this works is because now you're sorting a list thats only 10 elements long, so now the algorithm doesn't need to worry "oh jeez, the number in the 420th place is greater than it" or "the number in the 74th place is less than it? Too Bad!" instead it only needs to worry about it's slice of pie. You're still solving the same numbers (O(n)) but instead of checking if one slices is bigger than the other (log(n)) you instead just say, "fuck it, it's probably large enough". Counting sort, O(n) figures it out like that because it ranks each element on that list by how cool they are, counts how many times they show up on a separate list with each place being how cool they are, and then using how cool they are as well as how many, then creates a new list using said coolness and number. Pigeonhole Sort, O(n) same as counting sort, but now you just group them by rank pre-maturely in that separate list and if there's any two elements that are as cool as each other, they get placed in the same place in that list (hence pigeonhole, two pigeons in a hole), list is then created by going by increasing coolness in that list. Gravity Bead Sort, O(n^2), O(2^n) if it's not a number be given your maximum size (aka, the biggest number), then write a graph for each number with the height being the largest number and the width being the number of items sorted. Write the graph like a bar graph, by filling in the spaces up to the height of that number at that position. Now for the other reason why it's so fucking bad, we will now constitute the rule "if it looks taller, move it over". Now do that for every element each time going left-to-right, then keep combing left-to-right over and over again till it looks sorted. You COULD optimize it, but then it will lose it's novelty and just become bubble sort. American Flag Sort, O(n) Make a bucket (a fuckload of them) then write what will fall into the bucket like "like the numbers from 0 to 9" for instance, then will comb left to right and determine if it falls in. Now in that bucket, we will do the same, eventually we will end up with a sorted list. Why is this called the American Flag Sort? it uses the Dutch National Flag Algorithm (thanks Djikstra) and some guy in the NIST (US) made it. xlinux.nist.gov/dads/HTML/americanFlagSort.html Radix Sort, both MSD and LSD, O(wn) make a bucket, now make it by the least significant digit, this means that 1 and 11 and 111 and 1111 and 11111 are in the same bucket. Now do this for 0 to 9 (Radix in this case is 10, as 0 to 9 is 10 numbers, 2 is binary, and 16 is hexadecimal). Now for the next run, deal with the second least significant digit. Everything from 0 to 9 is left in the left-most part, and everything to the right is definitively greater than or equal to 10. In-place just means that this 0 to 9 and 10 to 99 and so on shifting is done each time the partition is separated instead of in a separate list. (since you're just moving stuff around) Flash Sort, O(n) using buckets, recursively split and sort buckets with insertion sort with prefix sum inputs. Or basically, push them again into the buckets, but using prefix sum, we can shittily determine that "hey, this LOOKS like this should be where it goes", and then we put it in. This makes insertion sorts job a lot easier since it says "yea this looks sorted" and can quit at any time.

[@hexlok2630]

holy shit dude you popped off with this

[@quack3891]

@@hexlok2630 there's missing a few, but I was too lazy and/or I forgor

[@39sankyuu]

fun wikipedia definition of gnome sort: "Gnome sort (nicknamed stupid sort) is a variation of the insertion sort sorting algorithm that does not use nested loops. Gnome sort was originally proposed by Iranian computer scientist Hamid Sarbazi-Azad (professor of Computer Science and Engineering at Sharif University of Technology) in 2000. The sort was first called stupid sort (not to be confused with bogosort), and then later described by Dick Grune and named gnome sort."

[@denizberkinmis]

bogo sort is the best when the list is already sorted I guess :p

[@DeenBoi]

Honestly kinda impressive

[@DarkonFullPower]

4:52 He played this at a faster speed. The sound "LSD sort" makes on 1x is magnitudes more haunting then what he heard.

[@Lazuley_]

This II-l album is fire 🔥🔥🔥

[@miwiki6]

watching sorting algorithms with BTMC is amazing

[@Yes.-_-]

At 3:15 it does this by counting how high each peak is, then it sort from high to low or low to high, it calculates this based off of its own review it did before (i think)

[@chikenplayz4440]

A little late, but counting sort literally counts the numbers in the array. It goes through the array and counts the number of ones, twos, and so on. It then arranges the numbers in order so it starts with the ones, twos, and so on until the array is sorted.

[@Arjun-hp2sp]

NO NOT AGAIN I FOUND THIS LIKE A YEAR AGO AND REWATCHED THIS 5 TIMES

[@LLL....]

Truly a BTMC reaction.

[@outlyings]

this is the content i subscribed for

[@glixh_hunt3r]

Wait, why did I watch this

[@kayparody]

Ahh yes, Asteroid Field of DECAPLETS

[@ItsRubyGD]

bro played so much osu even his heartbeat keeps the exact same rhythm

[@eqweqwqe5515]

truly the btmc highlight of all time

[@harukilol727]

the roundtable is making him lose his sanity

[@BOTNPC]

7:42 discord notification sort

[@diplogg6782]

Why are they making him watch this

[@m4sterred853]

BTMC software developer arc PauseChamp

[@xethaz8088]

guitar hero guy

[@thelastnoise9210]

KZbin: Obviously this game is OSU!

[@SilicosisNotBeta]

you guys ever feel like a bogosort rn

[@felixgg]

his best reaction video

[@nozie677]

weekly hairstyle change

[@benh4341]

BTMC wishing he did CS

[@Jasdewisafarmer]

I like his hair

[@ClampyStew]

wow

[@OyasuriZzz]

Beatmap ranked when?

[@Yhizi]

the most ridiculous BTMC react ever

[@Alawawagua954]

I dont know why but I just watch it till the end and dont know what I am doing LOL

[@ShiroCh_ID]

just like how BTMC said in this streams, He even didnt know why

[@Candelz]

whose gonna map this one

[@Stepped]

unrelated but ed is gonna play omori?

[@retr0foxx_osu]

where's the osu! map for this

[@EasonTek]

BRO WHY unexpected comp sci

[@august44_]

9:00 mcdonalds sort

[@arturfytsyk4998]

bpm?