Jump to content

Stable algorithm: Difference between revisions

From Wikipedia, the free encyclopedia
Content deleted Content added
No edit summary
rvv
Line 1: Line 1:
* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.
* 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 (~reddit).
* In numerical analysis, a [[numerically stable]] algorithm avoids magnifying small errors.


{{disambig}}
{{disambig}}

Revision as of 12:16, 7 September 2011

  • 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.