| Home | Libraries | People | FAQ | More

#### Definitions

##### stable sort

A sorting approach that preserves pre-existing order. If there are two elements with identical keys in a list that is later stably sorted, whichever came first in the initial list will come first in a stably sorted list. The algorithms provided here provide no such guarantee; items with identical keys will have arbitrary resulting order relative to each other.