Jump to content

Stable algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 146.247.169.160 (talk) at 08:25, 7 September 2011 (Undid revision 448904789 by 69.17.124.2 (talk)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
  • In computer science, a stable sorting algorithm is a sorting algorithm that preserves the order of records with equal keys
  • In numerical analysis, a numerically stable algorithm is an algorithm that is numerically stable