Stability in sorting means whether a sort algorithm maintains the relative order of the equals keys of the original input in the result output.
So a sorting algorithm is said to be stable if two objects with equal keys appear in the same order in sorted output as they appear in the input unsorted a...
