What is the difference between a sorting algorithm that is considered to be stable versus one that is unstable?
I know that stable and unstable refer to the action that is taken when two values compare as equal. I wanted a more watered down version though so I can understand this better.
