10 FORBIDDEN Sorting Algorithms
832,771
Published 2023-07-19
FlexiSpot E7 standing desk: bit.ly/44VUYtr - US
bit.ly/46Vvluo - Canada
In this video, I explored the realm of impractical sorting algorithms. Say goodbye to the usual and practical methods, and join me on a journey through a collection of algorithms that are downright wacky. We'll have a laugh while shedding light on the inefficiency and pure silliness of certain sorting approaches.
Chapters:
Introduction - 0:00
Sponsor - 1:08
Stalin Sort - 2:40
Sleep Sort - 3:17
Slow Sort - 3:59
Bogo Sort - 4:45
Bozo Sort - 5:20
Bogo Bogo Sort - 5:40
Quantum Bogo Sort - 6:28
Schrodinger's Sort - 7:09
Intelligent Design Sort - 7:41
Miracle Sort - 8:22
Outro - 8:53
đź’» Instagram: www.instagram.com/im.ardens/
đź’» Discord: discord.gg/yaNKyJ26pn
đź’» GitHub: github.com/myNameIsArdens
All Comments (21)
-
If you to upgrade your workstation too, don't miss their sale now and use my code ''YTB50'' for $50 off on order over $500. FlexiSpot E7 standing desk: bit.ly/44VUYtr - US bit.ly/46Vvluo - Canada
-
Gaslight Sort: - Take unsorted list. - Tell user, it is already sorted.
-
Thanos Sort: Randomly remove half of the elements until all the remaining are sorted. Edit: since so many people asked, I think if there were an odd number of elements, round the number to be snapped to the nearest odd, making the next even again
-
I'm a big fan of Intern Sort. Whenever something needs to be sorted, a ticket is created and sent to an intern to manually copy and paste the elements back in the correct order.
-
I recall learning about very fast sorting algorithm in my algorithms class which I surprisingly haven’t seen mentioned here. Multiply the entire array by 0 and now it’s sorted. I think it should be called “Kachow” sort because of its speed:
-
Moving Goalpost Sort: Take an unsorted array [8,1,6,0], re-define all numbers in mathematics so it is now sorted which means [8<1<6<0]
-
Miracle sort is basically me checking my empty fridge every hour or so to see if, miraculously, some food spawned in.
-
overwrite sort: set the value of the 1st element in the list to 1, the 2nd to 2, the 3rd to 3 and so on until you reach the end of the list.
-
The wikipedia sort. The algorithm publishes the unsorted list on wikipedia, and waits until a user edits the list. After a user edits the list, a wikipedia admin checks if the list is sorted. If it isn't we wait for another user to edit the list. A variant of this algorithm could include admins reverting changes for various reasons, as well as adding templates at the top of the page telling that "this list needs to be sorted".
-
Preplanning Sort: Input your initial data in a sorted order in the first place, thus removing the need to sort it.
-
Miracle sort can actually work: With an extremely low probability, cosmic rays could flip enough bits in memory to eventually result in a sorted list, that, with an even lower probability, might contain the original elements. The downside is that with a much higher probability, other bit flips occurring during that time will crash the program. Another downside is that just like Bogo Sort, Miracle Sort is not guaranteed to halt.
-
Bruteforce Sort: 1. Create an array of all possible n! permutations of the array to be sorted 2. Mark each array as "sorted = false". 3. For each array, make sure that each of its elements is not less than the previous one. If so, mark the array as "sorted = true". 4. Filter the array of arrays using "array.sorted === true" 5. The first element of the filtered array of arrays should be your sorted array.
-
Over the years, I've become a master of miracle sorting my problems in my life.
-
I'd like to propose "The Liar's Sort". This is where you have two machines with the same data. You let one machine do the actual sorting, and once it's done, you use the completed sort to sort the data on the second machine, making it look like it was sorted in one cycle.
-
Random construction sort: 1. Construct a random sorted list. 2. Check if the sorted and unsorted list contain the same elements. 3. Repeat until a match is found.
-
The way "miracle sort" made me burst into laughter at 5am after an all nighter...
-
The Bethoven sorting: It takes each element of the array and compares with a note of the Beethoven's 5th If the note is ascending, it changes it with the next value, if it's descending it changes with the previous. At the end of the array check if it's sorted, if not, continues the song on the beginning of the array, until it's sorted (the song goes in a loop)
-
Why not combine thread sort and bogo sort? Shuffle the array, create a new thread for each element, and use that to check if they are in the right order.
-
Political sort - have an unsorted list, say [9, 7, 1, 3, 4, 0, 8, 5, 2, 6], proceed by actively lobbying governments in all countries in the world to change meaning of the written numbers so that the list would appear sorted. E.g change the meaning of '9', so it's actually 0, '7' is actually 1 and so on.
-
Mutation Sort: Works by "mutating" the items in the list until they all fit The algorithm will loop through the items and check each item to see if it is less than the previous item. If it is, it will increment the item by 1 until it is bigger than the previous element.
