Which statement distinguishes stable sorting from unstable sorting?

Which statement distinguishes stable sorting from unstable sorting?

• A. Stable sorts preserve the relative order of equal elements; unstable sorts may not.
• B. Stable sorts are always faster than unstable sorts.
• C. Unstable sorts preserve input order of equal elements.
• D. Stable sorts discard duplicates.

Answer: (A)