Algorithm Benchmark
Plot algorithms on a performance curve across multiple input sizes. Each algorithm becomes a line; input size is the x-axis.
Input sizes (n)· 3 selected
Quick presets
Algorithms
— O(n log n)
— Other
— O(n²)
⚠ O(n²) sorts (Bubble, Insertion, Selection, Cocktail, Comb, Gnome, Pancake, Cycle, Odd-Even) disabled above n=5,000.
Data Type
Logos Sort, Adaptive Sort, Tim Sort (V8)random · n=10k, 100k, 1M · 3 rounds · 1 warm-up
All Algorithms
Sort by:
| time | O(n log n) |
| aux | O(log n) / O(n) |
| order | unstable |
| input | offline |
No benchmark data.
| time | O(n log n) |
| aux | O(log n) / O(span) |
| order | unstable |
| input | offline |
No benchmark data.
| time | O(n log n) |
| aux | O(n) |
| order | stable |
| input | offline |
No benchmark data.