Sorting Algorithms Visualizer
Shuffle, sort, and study visual patterns and complexity. Switch algorithms to see how comparisons and swaps evolve over time.
📊 Array Bars
⚙️ Controls
📚 Sorting Fundamentals
- Time complexity: average and worst-case growth with N.
- Stability: whether equal keys preserve order.
- In-place: memory usage and constant factors.
🌍 Applications
- Databases: external merge sort for massive data
- UI: animations and diffing sorted lists
- Analytics: order statistics, partial sorts
❓ Frequently Asked Questions
1) Why is quicksort fast on average?
Good partitioning yields O(N log N) comparisons on average.
Good partitioning yields O(N log N) comparisons on average.
2) When is merge sort better?
Stable, predictable O(N log N), great for linked lists and external sorting.
Stable, predictable O(N log N), great for linked lists and external sorting.
3) Is quicksort stable?
Classic quicksort is not stable; special variants can be.
Classic quicksort is not stable; special variants can be.
4) What about Timsort?
Hybrid of merge and insertion used in Python; exploits runs.
Hybrid of merge and insertion used in Python; exploits runs.
5) Why visualize?
Bar movements reveal algorithmic patterns and data sensitivity.
Bar movements reveal algorithmic patterns and data sensitivity.
6) Heap sort?
In-place O(N log N) but poor locality; rarely fastest in practice.
In-place O(N log N) but poor locality; rarely fastest in practice.
7) Are there linear-time sorts?
Counting/radix for integers/strings under constraints.
Counting/radix for integers/strings under constraints.
8) Parallel sorting?
Samplesort, bitonic sort; also map-reduce approaches.
Samplesort, bitonic sort; also map-reduce approaches.
9) Best for nearly sorted data?
Insertion sort often shines; quicksort with median-of-three helps.
Insertion sort often shines; quicksort with median-of-three helps.
10) Why worst-case O(N²)?
Adversarial input for quicksort partitions leads to degeneracy.
Adversarial input for quicksort partitions leads to degeneracy.