sorting-algorithms Definition Stable Sorting Algorithm A sorting algorithm is called stable if the order of equal elements is not changed. Examples: Merge Sort Insertion Sort