Seems like threaded sort could actually be useful for a fixed sort time if you know the maximum and scale the time appropriately.
@ZipplyZaneКүн бұрын
So every step in the bogobogo sort that doesn't involve all elements is completely wasted. It could even have sorted the whole thing (because the last item is already in place) but would try again.
@Kyoobur9000Күн бұрын
Patient Bogobogo Sort: 1) Record the initial state of the array. 2) Perform Miracle Sort. 3) If the state of the array changes by some miracle but it is NOT sorted, Bogobogo sort the list until it is in its initial state. 4) Repeat.
@kuriyoblacklotus4004Күн бұрын
Termination sort: Delete the whole list. No elements that need to be sorted, therefore the list is sorted
@bioboss8369Күн бұрын
Universal reset sort: 1. Check if list is sorted 2. If it isn’t, wait for the heat death and gravitational collapse of all things, and a new universe to come into existence 3. Check if list is sorted at the same time in the new universe 4. If unsorted, repeat steps 2-4
@leesweets4110Күн бұрын
I like the sorting algorithm that simply redefines a new alphabet or number system so that the list is already sorted under the new system. Its a top down approach. Very authoritarian, but effective. It works in precisely 1 iterations with no work needed.
@hatyyyКүн бұрын
how tf would you even wipe sitting down?
@JK17-1Күн бұрын
15:58 Zobros
@maxlin79862 күн бұрын
(bogobogo)^2 sort, where you use a normal bogobogo sort, but you run the bogo sort a second time every time it finishes a section, and if that is not correct, you restart.
@talhagamingplus922 күн бұрын
The answer was infinity
@boryswwa2 күн бұрын
I don't usually seek KZread for humoristic content so I don't remember when was the last time I LOLed at YT video. This one took me by surprise!
@gamma2042 күн бұрын
I have made a esoteric programming language where Road signs is the code
@Baymax-ij7rj3 күн бұрын
The whatever sort= Take your numbers [4,2,3,7] and just combine them with <, >, or = signs to prove that it's sorted, EX: [4,>2,<3,<7]. Basically does nothing!
@wubbst3 күн бұрын
my dream eso uses roman numerals as letters. so a would be I. this is how you would make a hello world script. XVI XVIII IX XIV XX "VIII V XII XII XV, XXIII XV XVIII XII IV!"
@leow.21623 күн бұрын
Another fast sorting algorithm would be just defining your list as sorted. It's similar to the one with intelligent design but more agnostic
@alexcai30023 күн бұрын
Is the icon Taiwan or just a leaf?
@somaannn3 күн бұрын
Suggestion: we clicked on this video, we know what's it about. Dont waste the first 1 min telling us what the video is about
@zoomstrikegaming4 күн бұрын
linear sort of sort sort one by one, go through each sorting algorithm ever created, and give each one a turn at the same array until it is (maybe) sorted
@ZettaiKatsu20134 күн бұрын
"Mom can we get flappy bird ? ” Mom: ”No we have flappy bird at home"
@edwardmack1225 күн бұрын
Murderhobo sort: destroy all data except the smallest
@JoachimFosse5 күн бұрын
05:34 *IMO* loops should be: <>__ | | _O __| |_ make a selection: <> then loop: O Fits better with the selection diagram. I get that this isn't the case in Raptor tho!
@GERARD5906 күн бұрын
Breakbogo sort: hard to explain Say you have a list, 3,4,7,1,2,0 Break the list into groups of three 3,4,7 1,2,0 sort them using bogosort 7,3,4 2,1,0 3,4,7 2,0,1 3,4,7 0,1,2 Now add the sorted groups into the array when sorted. If two or more are sorted at the same time shuffle them again. 3,4,7,0,1,2 Now, slide the last number to the first number 2,3,4,7,0,1 and repeat until sorted 2,3,4 0,1,7 7,2,3,4,0,1 7,2,3 4,0,1 3,2,7 0,1,4 0,1,4,2,3,7 7,0,1 4,2,3 0,1,7 2,3,4 7,1,0 4,2,3 and eventually 0, 1, 2, 3, 4, 7
@SomebodyHelp9756 күн бұрын
u forgot c++
@wisppandemonium81066 күн бұрын
The thing where things pick a state when "observed" can actually be explained pretty intuitively. "Observing" really just means interacting with something. So when you poke something that's kind of hovering between the two options, you make it pick one or the other.
@cerulity32k7 күн бұрын
Counting sort I would include here. While O(n) time complexity, it's space complexity increases with the range of values. That means that given the usize array [0, !0], it would need to allocate 16 EXABYTES of data. For reference, the Internet has around 1808.4 exabytes of traffic yearly. So, to sort a list, you would need to harness the power of 0.8% of the *_entire internet._* And that is a lot.
@cadedylan24777 күн бұрын
Delete all but one element then it is sorted
@richardirving81447 күн бұрын
Antisort: a sorting algorithm that checks to see if a data set is sorted by any metric known to man, and if so, randomizes it, then checks again. Repeat until the list is complete nonsense.
@dansullivan91527 күн бұрын
This actually sold me on PyCharm. I want an editor that's a pain in the ass about standards. Good video though, Ardens!
@vk8a88 күн бұрын
i live in bangladesh i live in bangladesh
@vk8a88 күн бұрын
i hheard someone come up with an esolang where every program source code is the same, but you cam write different programs by changing the compiler :p
@selalox3738 күн бұрын
not the brainfuck 😭😭🐝
@BLUEBLY4878 күн бұрын
why did you not mention Gdevelop or construct or game maker or unreal
@nathannorton59728 күн бұрын
Tolerance sort: a typical sort has a failure tolerance of 0, meaning each value may need to add or subtract 0 in order to be truely sorted. The tolerance sort simply increases this until the values are considered sorted. The
@nathannorton59728 күн бұрын
Shrodingers assumption sort: Randomly arrange an array. Assume that, because it has not been measured, it is now simultaneously all possible states, including sorted. Done
@juzerbaatwala88688 күн бұрын
I laughed so hard on when i heard about “stalin sort”😂
@NikodAnimations8 күн бұрын
Esolang Idea: what if there was an esolang, which every command was a string of number, and you had to locate the right string in pi (writing how many digits you need to get past to get to the start and end of the string).
@Doomslayer1519 күн бұрын
brainf*ck is really lightweight language that chatGPT can made with simple python code brainf*ck is means (brainmotherf*ckings*hit)
@mirat97539 күн бұрын
Saw this after a video about FaceDev making an esolang called bussin Lit num nocap rn
@mos_daniel10 күн бұрын
Manual sort algorithm: you pay sb to sort it
@Johan-zs9xh10 күн бұрын
😅😅
@cumcumcum14810 күн бұрын
7:36 don't be freaked out friend. You just misinterpreted the double slit experiment and wave-particle duality. The thing with electrons, is that yiu need to interact with them, to detect. You have to physically contact electron to measure it, so the act of interacting with a particle, makes it behave like a particle. But without interacting with it (observing is a wrong word) it behaves like a wave. Simple
@Xavier-op3us10 күн бұрын
7:41 *Until it is observed*
@xotlxoltyna13 күн бұрын
Gaslight sort: convince the user that the data is sorted at all costs
@iplay354213 күн бұрын
AMAZING VIDEO BUT WHY DID THE BUFFER GET ME? Subscribed
@GheeMoji13 күн бұрын
Fish sort : I fish in a tank chooses the numbers in an order idfk
@jaydentplays748513 күн бұрын
It doesn’t start until 2:39
@WoFTurtle14 күн бұрын
US Department of Transportation sort: If the numbers are not sorted, add another spot where the numbers can go
@nathanielcleland656614 күн бұрын
Oppenheimer Sort. Put the memory containing the array beside a nuclear bomb. Read it back in the timeframe between the bomb detonating, irradiating the memory, and the memory being vaporised. Repeat the procedure until a sorted list is read back.
@CooklieDev15 күн бұрын
Improved bogosort: Bogosort is a great algorithm but it will fail if you cant generate good random numbers. One good random number generator is looping through every possible turing machine. Whether or not a turing machine halts will seed the random number generator. So long as the turing machines are not in a bad order, said random number generator will theoretically reach every possible series of random bits, and therefore eventually sort the initial list. In order to make sure the turing machines are in a good order, we have to randomly sort them. Luckily, Improved bogosort also works well for randomizing a list, so we will use it to randomize the list of every possible turing machine.
@HipsterShiningArmor15 күн бұрын
DeSantis sort: check the list to see if its sorted. if not, instead of actually fixing anything, just blame the problem on LGBT people
Пікірлер
Seems like threaded sort could actually be useful for a fixed sort time if you know the maximum and scale the time appropriately.
So every step in the bogobogo sort that doesn't involve all elements is completely wasted. It could even have sorted the whole thing (because the last item is already in place) but would try again.
Patient Bogobogo Sort: 1) Record the initial state of the array. 2) Perform Miracle Sort. 3) If the state of the array changes by some miracle but it is NOT sorted, Bogobogo sort the list until it is in its initial state. 4) Repeat.
Termination sort: Delete the whole list. No elements that need to be sorted, therefore the list is sorted
Universal reset sort: 1. Check if list is sorted 2. If it isn’t, wait for the heat death and gravitational collapse of all things, and a new universe to come into existence 3. Check if list is sorted at the same time in the new universe 4. If unsorted, repeat steps 2-4
I like the sorting algorithm that simply redefines a new alphabet or number system so that the list is already sorted under the new system. Its a top down approach. Very authoritarian, but effective. It works in precisely 1 iterations with no work needed.
how tf would you even wipe sitting down?
15:58 Zobros
(bogobogo)^2 sort, where you use a normal bogobogo sort, but you run the bogo sort a second time every time it finishes a section, and if that is not correct, you restart.
The answer was infinity
I don't usually seek KZread for humoristic content so I don't remember when was the last time I LOLed at YT video. This one took me by surprise!
I have made a esoteric programming language where Road signs is the code
The whatever sort= Take your numbers [4,2,3,7] and just combine them with <, >, or = signs to prove that it's sorted, EX: [4,>2,<3,<7]. Basically does nothing!
my dream eso uses roman numerals as letters. so a would be I. this is how you would make a hello world script. XVI XVIII IX XIV XX "VIII V XII XII XV, XXIII XV XVIII XII IV!"
Another fast sorting algorithm would be just defining your list as sorted. It's similar to the one with intelligent design but more agnostic
Is the icon Taiwan or just a leaf?
Suggestion: we clicked on this video, we know what's it about. Dont waste the first 1 min telling us what the video is about
linear sort of sort sort one by one, go through each sorting algorithm ever created, and give each one a turn at the same array until it is (maybe) sorted
"Mom can we get flappy bird ? ” Mom: ”No we have flappy bird at home"
Murderhobo sort: destroy all data except the smallest
05:34 *IMO* loops should be: <>__ | | _O __| |_ make a selection: <> then loop: O Fits better with the selection diagram. I get that this isn't the case in Raptor tho!
Breakbogo sort: hard to explain Say you have a list, 3,4,7,1,2,0 Break the list into groups of three 3,4,7 1,2,0 sort them using bogosort 7,3,4 2,1,0 3,4,7 2,0,1 3,4,7 0,1,2 Now add the sorted groups into the array when sorted. If two or more are sorted at the same time shuffle them again. 3,4,7,0,1,2 Now, slide the last number to the first number 2,3,4,7,0,1 and repeat until sorted 2,3,4 0,1,7 7,2,3,4,0,1 7,2,3 4,0,1 3,2,7 0,1,4 0,1,4,2,3,7 7,0,1 4,2,3 0,1,7 2,3,4 7,1,0 4,2,3 and eventually 0, 1, 2, 3, 4, 7
u forgot c++
The thing where things pick a state when "observed" can actually be explained pretty intuitively. "Observing" really just means interacting with something. So when you poke something that's kind of hovering between the two options, you make it pick one or the other.
Counting sort I would include here. While O(n) time complexity, it's space complexity increases with the range of values. That means that given the usize array [0, !0], it would need to allocate 16 EXABYTES of data. For reference, the Internet has around 1808.4 exabytes of traffic yearly. So, to sort a list, you would need to harness the power of 0.8% of the *_entire internet._* And that is a lot.
Delete all but one element then it is sorted
Antisort: a sorting algorithm that checks to see if a data set is sorted by any metric known to man, and if so, randomizes it, then checks again. Repeat until the list is complete nonsense.
This actually sold me on PyCharm. I want an editor that's a pain in the ass about standards. Good video though, Ardens!
i live in bangladesh i live in bangladesh
i hheard someone come up with an esolang where every program source code is the same, but you cam write different programs by changing the compiler :p
not the brainfuck 😭😭🐝
why did you not mention Gdevelop or construct or game maker or unreal
Tolerance sort: a typical sort has a failure tolerance of 0, meaning each value may need to add or subtract 0 in order to be truely sorted. The tolerance sort simply increases this until the values are considered sorted. The
Shrodingers assumption sort: Randomly arrange an array. Assume that, because it has not been measured, it is now simultaneously all possible states, including sorted. Done
I laughed so hard on when i heard about “stalin sort”😂
Esolang Idea: what if there was an esolang, which every command was a string of number, and you had to locate the right string in pi (writing how many digits you need to get past to get to the start and end of the string).
brainf*ck is really lightweight language that chatGPT can made with simple python code brainf*ck is means (brainmotherf*ckings*hit)
Saw this after a video about FaceDev making an esolang called bussin Lit num nocap rn
Manual sort algorithm: you pay sb to sort it
😅😅
7:36 don't be freaked out friend. You just misinterpreted the double slit experiment and wave-particle duality. The thing with electrons, is that yiu need to interact with them, to detect. You have to physically contact electron to measure it, so the act of interacting with a particle, makes it behave like a particle. But without interacting with it (observing is a wrong word) it behaves like a wave. Simple
7:41 *Until it is observed*
Gaslight sort: convince the user that the data is sorted at all costs
AMAZING VIDEO BUT WHY DID THE BUFFER GET ME? Subscribed
Fish sort : I fish in a tank chooses the numbers in an order idfk
It doesn’t start until 2:39
US Department of Transportation sort: If the numbers are not sorted, add another spot where the numbers can go
Oppenheimer Sort. Put the memory containing the array beside a nuclear bomb. Read it back in the timeframe between the bomb detonating, irradiating the memory, and the memory being vaporised. Repeat the procedure until a sorted list is read back.
Improved bogosort: Bogosort is a great algorithm but it will fail if you cant generate good random numbers. One good random number generator is looping through every possible turing machine. Whether or not a turing machine halts will seed the random number generator. So long as the turing machines are not in a bad order, said random number generator will theoretically reach every possible series of random bits, and therefore eventually sort the initial list. In order to make sure the turing machines are in a good order, we have to randomly sort them. Luckily, Improved bogosort also works well for randomizing a list, so we will use it to randomize the list of every possible turing machine.
DeSantis sort: check the list to see if its sorted. if not, instead of actually fixing anything, just blame the problem on LGBT people