Jump to content

Stable algorithm

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 111.68.103.203 (talk) at 10:46, 24 March 2014. 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 preserves the order of records with equal keys.
  • In numerical analysis, a numerically stable algorithm avoids magnifying small errors.

See also