Stable algorithm: Difference between revisions
Content deleted Content added
simplify language; add definition for #2 |
No edit summary |
||
| 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. |
* In numerical analysis, a [[numerically stable]] algorithm avoids magnifying small errors (~reddit). |
||
{{disambig}} |
{{disambig}} |
||
Revision as of 12:06, 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 (~reddit).
This disambiguation page lists articles associated with the title Stable algorithm.
If an internal link led you here, you may wish to change the link to point directly to the intended article.
If an internal link led you here, you may wish to change the link to point directly to the intended article.