วีดีโอ

Maybe sorts: Pick a sort: When you write something to the main array, flip a coin, if it is heads, don’t write it to the array. Else, do write it to the array. When you are done, check to see if if it’s sorted. If not, do it again.

now program with rec room chips

you are right Praise Jesus!

16:25 WHAT XD

9:15 No way XD And then is 2 new lines a true new line? lol

4:45 XD

3:20 I FELT THAT WAY XD

2:46 Each line randomly? That wouldn't really effect Hello World lol

2:34 XD

2:30 Oh no

1:00 Great start XD

Ultimate Bogo sort: Start with an unsorted array and make 5 million copies of it. Then, randomize the order of all of them. If they are now all sorted, return the answer. If not, double the amount of copies (the new ones use the original order) and repeat.

MapSort.exe if (list = (sort = 0) ), then, (look = map) if (list = map), then, close else, repeat Map = 123 5678 10,15 List = 568 234,10 1,15

I made one called XOR and I’m making one right now called NoError

My favorites (purely because of the name): Half broken car in heavy traffic Lean mean bean machine

What about encrypting data with random keys until it's sorted?

Check out the geometry dash level "Brainfugd", it's really cool

Lossless Stalin sort: - Go through the list - Pull out reverse ordered elements into another list - Go through the other list backwards - Pull out reverse ordered elements into another new list - Go through the other new list forwards (you get the picture, repeat this until you get a small sorted list) - Then merge all pre-ordered lists back together like in merge sort

Crazy Sort 1) take the unsorted array 2) take any 2 elements 3) look at the 2 elements, are they sorted? 3a) If yes, do #4 3b) if no, swap them, then shuffle every other element in the array, then do #2 4) is the array sorted? 4a) if yes, stop "Crazy Sort" 4b) if no, do #2

Brainfvck order sort: initialize a new array and a working index in the exact middle of the array, for negative numbers move the working index to the left by how far from zero they are and set the value of the working index within the array to that value, do the same but moving to the right for positive numbers, then copy that array into a new array from left (negative numbers) to right (positive numbers) and ignore null elements of the array

Unpopular opinion (Maybe): I do appreciate Piet's masterpieces (I mean the artist, not the programming language) and seeing someone who made this makes me happy and fascinated

7:09 people love explaining both of the main concepts here incorrectly. 1. Shrodinger's cat is a *criticism* of the thing it describes. The cat is not, in fact, both alive and dead. It's a critique on the idea of observation causing the collapse of superpositions. 2. This is the double slit experiment. The particles don't simply change when being observed. The short of it is that while when not being observed, the particle behaves and creates a result in one way, but when we try to observe it, the methods used to observe something like that alter the particle's behaviors. It's not something like sentient particles knowing when they're being observed. Sorry if any of this was poorly explained or missing details.

ardens ardens ardens

Sleep Sort(space-time variation) Take each element of the array and assign it to a new array at an index equal to it's value. So 10 goes into a[10], 999 goes into a[999] and so on. The resulting array is sorted(with a bunch of empty spaces in between).

3:25 🤣

The miracle sort is also known as the cosmic ray induced memory parity error sort

D&DSort: Define two arrays, the array to be sorted and the dead array. Append 0 to the start of the sorting array. For each element (other than the initial 0), have it attack by adding a random number between 1-20. Check if this total is higher than the previous element's result. If it is, it hits, and the previous element is moved to the dead array. Once all attacks have been resolved, raise the dead elements and append them to the end of the sorting array. Check if it is sorted in descending order. If not, repeat with another round of combat (sorting).

Damn man really missed out on Clickteam Fusion which is probably the most F--D UP BRAINDEAD visual coding thing and goes back to Windows 3.1 days.

Confidential Sort: 1: Check if the list is sorted or not. 2: Don't let anyone see it and tell them that it's sorted.

me when the quantum bogosort fai

random bubble sort: if the number below is higher than the number above, move it to a random position. keep going until sorted.

ya forogoadojaoifhckjdsknjcfhndkfnudufchdkhgfvhjhfdsfdshjudfshjudfshudhsdsGUFDYFIYGGFGHFHBFRyuFYFUfUyufuFFuyfyufudfgigkaYGIY

no, light attract bugs!

Stalinbogo sort: Randomize the numbers, then stalin sort them. Garrentied to lose most of your data.

Skibidi sort: pee on the unsorted elemtmnt until it screams "doctor junior"

Mine would be a programming language where 50% of characters are not read.

7 through 9 aren't even sorting anything and 10 is just using whatever actual algorithm God uses, you know, if it happens to be part of His plan. Hilariously, 10 is actually possible because we have observed bit flips because of cosmic rays. Unlike 7 through 9.

me clicking in this video, and trying to learn soemthing useful...

human sort: your list is sent to a person that has to sort it manually (all lists go to the same person so you have to wait for your turn) (when they die a successor is elected)

modified stalin sort: rewrite the removed elements to a lower class array, and repeat. if you want to make it actually work, you would then order the classes from lowest to highest, and repeat the entire process from the beginning

Im going to guess that he is gonna type "your mom". Yes.

1/0 = inf and -inf at the same time

3:18 UmMM.. actuaLly LuA ALsO dOeSnT hAVE SeMIcOLonS.🤓🤓🤓👆👆

Scratch is not a programming language.ut is a way to learn programming basic noodles for beginners,but in real world of code,I am considering java and c++ as boss

Here's an idea for a stupid sorting algorithm: Effective bozo sort. It's like bozo sort, except that it only swaps the two chosen items if they're not relatively sorted. Like, if the first item picked was a 3 and the second item was a 5, it would not swap them.

1/0 is pretty much an infinitely large number. Or it’s 0 or it’s an infinitely large negative number. In essence you can’t divide by 0 and get any single number out of it.

i love light mode, it doesnt blur the text thus making it easier to read with suitable brightness

Hitler Sort: 1.Sort the items into groups based on similarities. 2. Randomise the groups 3. Use Stalin sort to sort the groups 4. Use Stalin Sort to sort the things in the groups 5. Ungroup the items.

How about grey mode?)

The chef code really through me one for a minute, but I figured it out. Each ingredient (variable) is the ascii character value for a letter. You add all the letters together by putting them in the bowl. Liquefying them must mean concatenate and then you bake/serve the answer. haricot beans = H eggs = e lard = l (lowercase L) oil = o zucchinis = [ ] (space) water = w red salmon = r dijon mustard = d potatoes = !