100
10.0ms
Comparisons 0
Swaps 0
Algorithm Phase Ready
Recursion Depth 0
Unsorted
Comparing
Swapping
Pivot
Less than Pivot
Greater than Pivot
Sorted

📊 Algorithm Insights

This visualization shows an Introsort implementation - a hybrid sorting algorithm that combines:

  • Pattern Detection: Detects already sorted/reversed arrays in O(n)
  • Quicksort with 3-way partitioning (Dutch National Flag) for handling duplicates
  • Tukey's Ninther for robust pivot selection
  • Insertion Sort for small subarrays (≤16 elements)
  • Heapsort Fallback when recursion depth exceeds 2×log₂(n)