Stable Sort
ˈsteɪb(ə)l sɔːt
An attribute of sorting algorithms, indicating that values retain their original order provided this does not conflict with the sort order. E.g. values which are identical with respect to sort order are not shuffled. Most common sorting algorithms such as QuickSort and HeapSort are not stable.