⚙
Filter ▾
Bubble sort Cocktail shaker sort Odd-even sort Comb sort Circle sort Selection sort Double selection sort Cycle sort Pancake sort Insertion sort Pair insertion sort Binary insert sort Gnome sort Library sort Merge insertion sort Shell sort (Knuth 1973) Shell sort (Sedgewick 1986) Shell sort (Tokuda 1992) Shell sort (Ciura 2001) Shell sort (Lee 2021) Merge sort Pingpong merge sort Bottom-up merge sort std::stable_sort (LLVM) Rotate merge sort Rotate merge sort (Recursive) SymMerge sort Block sort (WikiSort) Natural merge sort Timsort Powersort ShiftSort Spinsort Flat stable sort Glidesort Driftsort Heapsort Min-heap sort Ternary heapsort Bottom-up heapSort Weak heapSort Smoothsort Tournament sort Binomial heap sort Pairing heap sort Quicksort Quicksort (3-way) Quicksort (Median3) Quicksort (Median9) DualPivot Quicksort Quicksort (Stable) Quicksort (Bidirectional Stable) Quicksort (Destswap Stable) BlockQuickSort Introsort Introsort (.NET) Pattern-defeating quicksort PDQ sort (branchless) std::sort (LLVM) Ipnsort Drop-Merge sort Patience sort Strand sort Counting sort Pigeonhole sort Bucket sort Flash sort LSD Radix sort (b=4) LSD Radix sort (b=10) LSD Radix sort (b=256) MSD Radix sort (b=4) MSD Radix sort (b=10) American flag sort Spreadsort Bitonic sort Bitonic sort (Recursive) Batcher odd-even merge sort Binary tree sort (BST) Binary tree sort (AVL) Splay sort Treap sort Cartesian tree sort B-tree sort B-plus tree sort Bogo sort Slow sort Stooge sort
Array Size (Recommended: 4096)
8 16 32 64 128 256 512 1024 2048 4096 ★ 8192 16384 32768
Scramble Pattern
🎲 Random ↗️ Sorted (Ascending) ↘️ Reversed (Descending) ➡️ Single Element Moved ≈ Almost Sorted (5% Pair Swaps) ≈ Nearly Sorted (10% Random) 📍 Scrambled Tail (14% at End) 📍 Scrambled Head (14% at Start) 🔊 Noisy (Block Shuffled) 🔢 Shuffled Odds Only 📊 Shuffled Half (Front Sorted) 🎲 Evens Reversed, Odds In-Order 🎲 Evens In-Order, Scrambled Odds 🔄 Double Layered (Symmetric Swap) 🔗 Final Merge (Even/Odd Sorted) 🔗 Shuffled Final Merge ⚙️ Sawtooth (4-way Interleaved) 📐 Partitioned (Halves Shuffled) 📊 Half Sorted ↕️ Half Reversed 🎹 Pipe Organ 🏞️ Valley Shape 🔢 Final Radix Pass 🔢 Real Final Radix (Bitmask) 🔢 Recursive Final Radix 🔄 Final Bitonic Pass 🔁 Bit Reversal (FFT) 🧱 Block Randomly Shuffled 🧱 Block Reversed 🔀 Interlaced 〰️ Zigzag Pattern 🌳 BST In-Order Traversal 🌳 Inverted BST 📈 Logarithmic Slopes 🔄 Half Rotation 📚 Heapified (Max-Heap) 📚 Poplar Heapified 📚 Triangular Heapified 🔢 Few Unique (16 Values) 🔢 Many Duplicates (20%) 🔢 Skewed Duplicates ⚪ All Equal 📊 Quadratic (x²) 📊 Square Root (√x) 📊 Cubic (x³ Centered) 📊 Quintic (x⁵ Centered) 📊 Cube Root (∛x) 📊 Fifth Root (⁵√x) 〰️ Sine Wave 〰️ Cosine Wave 🔔 Bell Curve (Normal) 🌊 Perlin Noise Curve 📐 Ruler Function 🍮 Blancmange Curve ∞ Cantor Function ➗ Sum of Divisors ✈️ Fly Straight Dangit 📉 Reverse Log % Modulo Function φ Euler Totient ⭕ Circle Sort Pass 🔗 Pairwise Pass 🔄 Recursive Reversal 🔲 Gray Code Fractal 🔺 Sierpinski Triangle 🔻 Triangular ⚔️ QuickSort Adversary ⚔️ PDQ Adversary ⚔️ Grail Adversary ⚔️ ShuffleMerge Adversary ⚔️ TimSort Adversary
Algorithms:
0 / 9