Stable

알고리즘이 stable 하다는 건 무슨 뜻일까?

A stable sort is one which preserves the original order of the input set while The unstable algorithm exhibits undefined behaviour when two elements are equal, it is perfectly possible that the order is sometimes preserved.