Wikipedia: History of Stable sort

Difference (from prior major revision) (author diff)

Changed: 10c10

Many other sorting algorithms can be specially implemented to be stable sorts.

Many other sorting algorithms can be specially implemented to be stable sorts. One way of doing this is to artificially extend the key comparison, such that comparisons between two objects with otherwise equal keys are decided using the order of the entries in the original data order as a tie-breaker.

	Revision 5 . . December 13, 2001 7:09 am by (logged).253.39.xxx [Mention key extension hack...]
	Revision 4 . . December 13, 2001 7:06 am by (logged).253.39.xxx [clarification: same value -> equal key values. Otherwise, they're indentical, and ordering does not apply, making sentence wrong...]
	Revision 3 . . (edit) October 30, 2001 12:39 am by Taw [format fix]