Stable sorting algorithms are those that maintain the relative order of records with equal keys (or values) when sorting a list. In other words, if two elements have equal values and one appears before the other in the original input, a stable sort will ensure that the one that appeared first retains its position relative to the other in the output.
New to topics? Read the docs here!