256(?) Sorting Algorithms in 3 Hours (feat. ArrayV Has a Mental Breakdown)

Рет қаралды 21,937

3 жыл бұрын

This was supposed to be a fully shuffled version of Gaming32's 256 Sorting Algorithms video, but it turned for the weirdest when I least expected it.
Check out the program here: github.com/gaming32/ArrayV-v4.0
Visit The Studio here: / discord
More sorting videos: • Community-made Sorting...

Пікірлер: 46

@SkylineMasher 9 ай бұрын

Radix LSD base 10 actually sorted the video quality when sorting the array (1:26:58)

@OneDotLeader 2 жыл бұрын

fire sort was the most emotionally invested i had ever gotten in a sorter

@californium-2526 2 жыл бұрын

Stupid Fire for me.

@qwkq 3 ай бұрын

Timestamp 2:42:24 for future viewers

@itzwindows 2 жыл бұрын

(WIP) Here's a list of timestamps for each of the sorts: Exchange Sorts: 0:04 Unoptimized Bubble Sort 0:31 Bubble Sort 0:47 Optimized Bubble Sort 1:02 Reverse Bubble Sort 1:22 Unoptimized Cocktail Shaker Sort 1:47 Cocktail Shaker Sort 2:10 Optimized Cocktail Shaker Sort 2:25 Chinotto Sort 3:07 Wiggle Sort 3:37 Odd-Even Sort 3:59 Swap Map Sort 4:18 Optimized Stooge Sort 4:41 Studio Stooge Sort 4:59 Grate Sort 5:43 Reverse Grate Sort 6:56 Cocktail Grate Sort 7:50 Fun Sort 9:29 Gnome Sort 9:59 Optimized Gnome Sort 10:20 Optimized Gnome Sort + Binary Search 11:33 TriSearch Gnome Sort 12:21 Reverse Gnome Sort 12:42 Gnome Weave Sort (High Prime) 13:16 Gnome Weave Sort (Low Prime) 14:06 Slope Sort 14:48 Comb Sort 15:10 Recursive 3-Smooth Comb Sort 15:47 Parallel 3-Smooth Comb Sort 15:56 Iterative 3-Smooth Comb Sort 16:30 Classic 3-Smooth Comb Sort 17:04 Recursive Circle Sort 18:15 Iterative Circle Sort 19:21 Circle Merge Sort 20:26 Iterative Pseudo-Heap Sort 21:37 Quick Sort, Left/Left Pointers 22:33 Quick Sort, Left/Left Pointers (Middle Pivot) 23:13 Quick Sort, Left/Right Pointers 23:45 Parallel Quick Sort, Left/Left Pointers 23:58 Dual-Pivot Quick Sort 24:28 Stackless Quick Sort 25:29 Iterative Quick Sort 25:58 Stable Quick Sort 26:26 Stable Quick Sort (Middle Pivot) 26:57 Out-of-Place Stable Quick Sort (by Control) 27:18 Parallel Stable Quick Sort 27:38 Forced Stable Quick Sort 28:22 Lazy Stable Quick Sort 29:01 Table Sort 29:34 Index Quick Sort Quick Sorts: 30:06 Cube Root Quick Sort Selection Sorts: 30:38 Selection Sort 31:01 Reverse Selection Sort 31:22 Double Selection Sort 31:37 Stable Selection Sort 32:21 Sandpaper Sort 32:50 Reverse Sandpaper Sort 33:14 Cycle Sort 34:17 Stable Cycle Sort 35:10 Bingo Sort 35:28 Max Heap Sort 36:00 Min Heap Sort 36:34 Flipped Min Heap Sort 37:07 Base-N Max Heap Sort, Base 4 37:27 Triangular Heap Sort 38:09 Weak Heap Sort 38:40 Ternary Heap Sort 39:13 Smooth Sort 39:51 Poplar Heap Sort 40:23 Tournament Sort 40:59 Classic Tournament Sort 41:36 Asynchronous Sort 41:57 Queue Sort 42:10 Dequeue Sort Insertion Sorts: 42:22 Insertion Sort 42:52 Reverse Insertion Sort 43:21 Double Insertion Sort 44:06 Binary Insertion Sort 45:17 Adaptive Binary Insertion Sort 45:52 thatsOven's TriSearch Insertion Sort 46:41 Fibonacci Insertion Sort 48:04 Gambit Insertion Sort 49:41 Unstable Insertion Sort 50:24 Shell Sort 51:15 Cocktail Shell Sort 52:07 yuji's Recursive Shell Sort 52:42 Parallel Shell Sort 53:07 Lancewer's Rendezvous Sort 54:07 Room Sort 54:52 Library Sort 55:33 Classic Library Sort 56:10 Patience Sort 56:34 Classic Unbalanced Tree Sort 57:16 Tree Sort (Unbalanced) 57:40 Shuffled Tree Sort 58:34 Tree Sort (AA, Balanced) 58:58 Tree Sort (AVI, Balanced) 59:21 Splay Sort Merge Sorts: 1:00:17 Merge Sort 1:01:21 Bottom-Up Merge Sort 1:02:23 Parallel Merge Sort 1:02:40 Partial Merge Sort 1:03:28 Iterative Top-Down Merge Sort 1:04:31 Weaved Merge Sort 1:05:34 Twin Sort 1:06:35 Natural Merge Sort 1:07:55 Pattern-Defeating Merge Sort 1:09:11 In-Place Merge Sort 1:09:56 Improved In-Place Merge Sort 1:10:39 Out-of-Place Weave Merge (by Control) 1:10:57 Lazy Stable Sort 1:12:12 Reverse Lazy Stable Sort 1:13:50 Modulo Merge Sort 1:14:37 Block-Swap Merge Sort 1:15:20 Rotate Merge Sort 1:16:32 Parallel Rotate Merge Sort 1:16:47 Andrey Astrelin's In-Place Merge Sort 1:17:52 Split-16 Merge Sort 1:18:54 Index Merge Sort 1:19:40 New Shuffle Merge Sort 1:20:22 Strand Sort 1:21:06 Buffered Stooge Sort 1:21:52 Optimized Pancake Sort Distribution Sorts: 1:22:56 Counting Sort 1:23:08 Pigeonhole Sort 1:23:19 Optimized Pigeonhole Sort 1:23:29 thatsOven's featureSort 1:23:51 Gravity (Bead) Sort 1:24:22 Classic Gravity (Bead) Sort 1:25:01 Static Sort 1:25:17 Simple Static Sort 1:25:30 Optimized Index Sort 1:25:41 American Flag Sort, 128 Buckets 1:26:02 Stackless American Flag Sort 1:26:20 Least Significant Digit Radix Sort, Base 4 1:26:55 In-Place LSD Radix Sort, Base 10 1:27:25 Most Significant Digit Radix Sort, Base 4 1:28:05 In-Place MSD Radix Sort, Base 4 1:28:53 L/MSD Radix Sort 1:29:38 Flash Sort 1:29:59 Iterative Binary Quick Sort 1:30:32 Recursive Binary Quick Sort 1:31:04 Stackless Binary Quick Sort 1:31:59 Quick Binary Radix Sort 1:32:48 Shatter Sort 1:33:05 Simple Shatter Sort 1:33:34 Immediate Shatter Sort 1:33:45 Time Sort, Mul 10 Concurrent Sorts: 1:34:04 Fold Sorting Network 1:34:49 Crease Sorting Network 1:35:50 Apollyon Sort 1:36:26 Matrix Sort 1:37:23 Batcher's Bitonic Sort 1:38:08 Batcher's Odd-Even Merge Sort 1:38:50 Recursive Pairwise Sorting Network 1:39:30 Recursive Bose-Nelson Sorting Network 1:40:16 Recursive Weave Sorting Network 1:40:55 Recursive Diamond Sort 1:42:17 Recursive Pairwise Merge Sort 1:42:56 Parallel Bitonic Sort 1:43:08 Parallel Odd-Even Merge Sort 1:43:16 Parallel Bose-Nelson Sorting Network 1:43:37 Iterative Bitonic Sort 1:44:22 Iterative Odd-Even Merge Sort 1:45:03 Iterative Pairwise Sorting Network 1:45:44 Iterative Bose-Nelson Sorting Network 1:46:31 Iterative Weave Sorting Network 1:47:10 Batcher's Merge-Exchange Sort 1:47:46 Iterative Diamond Sort 1:49:08 Iterative Pairwise Merge Sort Hybrid Sorts: 1:49:48 Hybrid Comb Sort 1:50:08 Recursive Introspective Circle Sort 1:50:50 Iterative Introspective Circle Sort 1:51:31 Pairwise-Circle Sort 1:52:37 Quick Sandpaper Sort 1:53:10 Binary Merge Sort 1:54:26 Merge-Insertion Sort 1:55:20 SwapMerge Sort 1:56:08 Base-N Merge Sort (4 Bases) 1:56:57 Weave Merge Sort 1:58:15 Improved Weave Merge Sort 1:59:08 Tim Sort 2:00:12 Cocktail Merge Sort 2:01:31 Bubble Merge Sort 2:02:50 Optimized Pattern-Defeating Merge Sort 2:03:46 Binary Pattern-Defeating Merge Sort 2:04:42 Threaded Pattern-Defeating Merge Sort 2:05:10 Lazier Stable Sort 2:06:33 Laziest Stable Sort 2:07:40 Wikisort 2:10:01 Grailsort 2:11:28 Adaptive Grail Sort (Block Merge Sort) 2:12:37 Unstable Grail Sort 2:13:56 Sqrtsort 2:15:12 Kotasort 2:16:23 Ectasort 2:17:30 Parallel Block Merge Sort (doesn't finish sorting correctly) 2:18:04 Parallel Grail Sort 2:18:36 Flan Sort 2:19:16 Remi Sort 2:19:57 Buffered Merge Sort 2:21:11 Out-of-Place Buffered Merge Sort 2:22:24 Block Selection Merge Sort 2:24:18 Improved Block Selection Merge Sort 2:25:35 Median Mergesort 2:26:14 Buffer Partition Merge Sort 2:26:58 Third Merge Sort 2:28:05 Stable Third Merge Sort 2:29:27 Bubblescan Merge Sort 2:30:14 Introspective Sort 2:30:44 Optimized Bottom-Up Merge Sort [std::stable_sort] 2:31:30 Optimized Dual-Pivot Quick Sort [Arrays.sort] 2:32:05 Optimized Weave Merge Sort 2:33:06 Stupid Quick Sort 2:34:22 thatsOven's Logarithmic Average QuickSort 2:35:08 thatsOven's Median-Of-16 Adaptive Quick Sort 2:36:12 Stackless Hybrid Quicksort 2:37:13 Stackless Dual-Pivot Quicksort 2:38:03 Pattern-Defeating Quick Sort 2:38:38 Branchless Pattern-Defeating Quick Sort 2:39:29 Drop Merge Sort Miscellaneous Sorts: 2:40:05 Pancake Sorting 2:41:14 Burnt Pancake Sort Impractical Sorts: 2:42:24 Fire Sort 2:43:58 Stupid Fire Sort 2:45:20 Reflection Sort 2:45:40 Bad Sort 2:46:54 Stooge Sort 2:48:24 Stable Stooge Sort 2:49:26 Quad Stooge Sort 2:49:35 Silly Sort 2:49:43 Slow Sort 2:49:52 Snuffle Sort 2:50:05 Hanoi Sort 2:50:21 Stable Hanoi Sort 2:50:47 Napoleon Sort 2:51:00 Selection Bogo Sort 2:51:25 Bubble Bogo Sort 2:51:34 Cocktail Bogo Sort 2:52:14 Markov Sort 2:52:34 Less Bogo Sort 2:53:19 Exchange Bogo Sort 2:53:25 Median Quick Bogo Sort 2:54:52 Quick Bogo Sort 2:55:00 Merge Bogo Sort 2:55:14 Smart Guess Sort 2:55:39 Bozo Sort 2:57:33 Deterministic Bogo Sort 2:57:45 Smart Bogo Bogo Sort 2:58:04 Slice Bogo Sort 2:58:10 Bogo Sort 2:58:31 Optimized Guess Sort 2:58:49 Random Guess Sort 3:00:01 Guess Sort 3:00:23 Bogo Bogo Sort

@oomas7209 Жыл бұрын

You really don’t have a life do you?

@itzwindows Жыл бұрын

@@oomas7209 No lol

@richardselby4930 11 ай бұрын

thanks 👍

@SC-750theMarbleMan Жыл бұрын

there are actually multiple other things about sorts that I have: 1. What is “slice” bogo sort? 2. (Although it is not in this video) what does merry-go-round do? Lots of stuff happening in that sort. 3. What different things are done in stooge and Hanoi’s stable counterparts?

@T-01-31-ALEPH 8 күн бұрын

2:55:40 sounds like what you'd hear when your Geiger counter goes OFF THE CHARTS.

@californium-2526 2 жыл бұрын

1:26:55 Everyone likes it. We all know it. The KZbin compression destroying in-place LSD Radix sort, with its O(n² log_base n) complexity.

@SkylineMasher 8 ай бұрын

The sort was sorting the video quality

@reonarudo2665 10 ай бұрын

WE R LOSING THE LOBOTOMY WITH THIS ONE!!! 🗣 📢 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥 🔥

@Limeappl890 5 ай бұрын

Uh wrong video bud

@SkylineMasher 8 ай бұрын

Where is circle optimized weave merge sort? It was supposed to come after optimized weave merge sort. Also, parallel block merge sort failed (2:17:59)

@slashtehflygon1722 24 күн бұрын

Watching this at 2x speed is borderline incomprehensible

@Scudmaster11 6 ай бұрын

Pancake sort becomes good

@markdeqwark66 10 ай бұрын

A single mom who works two jobs and loved her kifs and never stops

@daisyreeabalde7888 Ай бұрын

256 Sorting Altogram Vissluated-LeftStuff

@Grass__Toucher Жыл бұрын

This shit helps me -recharge- sleep at night

@SkylineMasher 8 ай бұрын

So why does it say “ArrayV has a mental breakdown”

@SkylineMasher 8 ай бұрын

2:14:27 hold up that pointer got stuck

@Grexlivne 5 ай бұрын

LOLL

@ishu4227 Ай бұрын

15:47 parrarel sorts: if you blink you miss it

@carter...949 Жыл бұрын

Thank you

@SC-750theMarbleMan Жыл бұрын

what even happened to parallel block merge sort?? what caused this to happen? (I’m assuming it was fixed since this is an older video) 2:17:30 edit: I also noticed that highlight that was stuck on there… strange ArrayV bug!! 2:04:40 2:16:56

@PCBoyStudios Жыл бұрын

At that point in ArrayV development, the file for the highlighting system was being refactored. Parallel Block Merge used highlights in a way that only the old highlighting code would make seem to work. Emerald Block, the one refactoring the code, found out the problem was due to an invalid asynchronous clearing of marks, where it should be synchronized. This caused Binary Insertion to fail in parallel, and thus the whole sort. More details in this GitHub issue: github.com/Gaming32/ArrayV/issues/43