Sort Target
Algorithm
Speed
Normal ~12s · 34 ms/step
Introsort (.NET)(1997)
▶ Try this Source
O(n log n) ✗ Stable ✓ In-place
🔧 How it works

The Introsort variant used inside the .NET runtime (Array.Sort); follows the same Quicksort → Heapsort → Insertion sort hybrid strategy but with .NET-specific depth threshold and small-array cutoff values.

🎯 Key property

Tuned for the managed runtime and JIT compiler, the threshold sizes differ from generic Introsort to maximise performance under .NET's memory model and compilation characteristics.

👁 Watch for
  • Compare (Quicksort phase) left-right partition scan testing each element against the pivot; cross-boundary swaps follow
  • Swap (Heapsort fallback) when the .NET-specific depth limit is hit, the pattern shifts to sift-down swaps moving elements downward through heap levels
  • IndexWrite (Insertion sort finish) once sub-arrays shrink below the .NET-specific cutoff, leftward element shifts replace partitioning
🕰 History 🌳 Lineage ⚡ Optimization
UsesTail Recursion EliminationHybrid SwitchingAdaptive Pivot Selection
Initial State
This is the array before sorting. Follow Introsort (.NET) step by step.
Recursion Tree
[0..31)51736248139151114101216211723192218202429253127302628
0 / 356 ops ( 0.0%) 0.0%
• © 2026 guitarrapc. All rights reserved.
Sorting is
a spectacle.
Algorithms at work, in a daily vertical feed. Watch, play, challenge — and go deeper when you're ready.
Loading 0%
An unhandled error has occurred. Reload 🗙