 A sorting algorithm is stable if whenever there are two records R and S with the same key, and R appears before S in the original list, then R will always appear before S in the sorted list.When equal elements are indistinguishable, such as with integers, or more generally, any data where the entire element is the key, stability is not an issue.Stability is also not an issue if all keys are different.