stable sort

RU: стабильная сортировка

A sorting algorithm is stable if it preserves the original relative order of elements that compare as equal. Stability matters when records have multiple keys and a previous sort's secondary ordering must be retained. Merge sort and Timsort are stable; heapsort and standard quicksort are not.