Visualizer Strings Compare Benchmark Library About

Performance Benchmark

Measure raw execution speed of algorithms.

Select Algorithms

3-Way Quick Sort Batcher Odd-Even Merge Sort Binary Insertion Sort Bitonic Sort Bottom-Up Merge Sort Bubble Sort Bucket Sort Cartesian Tree Sort Cocktail Sort Comb Sort Counting Sort Cycle Sort Distributed Bucket Sort Dual-Pivot Quick Sort Flashsort Gnome Sort Grail Sort Heap Sort In-Place Merge Sort Insertion Sort Intelligent Design Sort Intro Sort Library Sort Merge Sort Natural Merge Sort Odd-Even Sort Pancake Sort Parallel Merge Sort Patience Sort Pigeonhole Sort Quick Sort Radix Sort Randomized Quick Sort Randomized Shellsort Sample Sort Selection Sort Shell Sort Skip List Sort Slow Sort Smooth Sort Splay Sort Integer Spreadsort Stalin Sort Stooge Sort Strand Sort Thanos Sort Tournament Sort Treap Sort Tree Sort

Array Size: 1,000 items

100 20,000

Iterations per Algo: 5