Scans for natural runs with a strict acceptance threshold (squared length must exceed half the remaining elements), manages runs in three logical states with deferred quicksorting, and schedules merges via a Powersort merge tree.
Combines Powersort's near-optimal merge scheduling with stable bidirectional quicksort and branchless sorting networks for small blocks. Deferred quicksort avoids processing unsorted regions until a merge requires it, reducing work on partially structured inputs. The algorithm behind Rust's stable sort.