Stable algorithm: Difference between revisions
Content deleted Content added
No edit summary |
সাব্বির আলম (talk | contribs) No edit summary Tag: Reverted |
||
| 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 [[numerical stability|numerically stable]] algorithm avoids magnifying small errors. |
* In numerical analysis, a [[numerical stability|numerically stable]] algorithm avoids magnifying small errors.An algorithm is stable if the result produced is relatively insensitive to perturbations during computation |
||
== See also == |
== See also == |
||
Revision as of 04:24, 25 February 2022
- 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.An algorithm is stable if the result produced is relatively insensitive to perturbations during computation
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.