7 docs tagged with "sorting"

Adjacent-swap sorting, its invariant, and its narrow practical role.

In-place sorting with a binary heap and a worst-case n-log-n bound.

Adaptive stable sorting for small or nearly ordered ranges.

Stable divide-and-conquer sorting with predictable runtime and linear array workspace.

Partition-based sorting, pivot risk, duplicate handling, and stack discipline.

Minimum-selection sorting with fixed comparison cost and few swaps.

A decision map for comparison sorting, stability, adaptiveness, and memory trade-offs.