adaptive sort

RU: адаптивная сортировка

A sorting algorithm that detects and exploits existing order in its input, running faster when the input is partially or fully sorted. The more presorted the data, the fewer comparisons and moves are needed. Timsort, used in Python and Java, is the canonical example: it identifies natural ascending or descending runs and merges them.