Assertion: sorting algorithm | /r/HasProperty | stable
Facets:
Source sentences:
text: A sorting algorithm is stable if whenever there are two records R and S with the same key, and R appears before S in the original list, then R will always appear before S in the sorted list.