Stable algorithm: Difference between revisions
Content deleted Content added
replace distribution-specific see-also link with dab pages |
avoided redirection |
||
| 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 [[numerical stability|numerically stable]] algorithm avoids magnifying small errors. |
||
== See also == |
== See also == |
||
Revision as of 19:01, 6 January 2012
- 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
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.