Jump to content

Stable sort

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 213.253.39.xxx (talk) at 23:06, 12 December 2001 (clarification: same value -> equal key values. Otherwise, they're indentical, and ordering does not apply, making sentence wrong...). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A stable sort is a sorting algorithm that does not change the relative order of elements that have equal key values. This is important for some algorithms (for example, radix sort).


Some common stable sorts are:


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


Retrieved from "https://en.wikipedia.org/w/index.php?title=Stable_sort&oldid=282925"