Stable algorithm: Difference between revisions

Content deleted Content added

Inline

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.

@@ Line 1: / Line 1: @@
 * 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.An algorithm is stable if the result produced is relatively insensitive to perturbations during computation
+* In numerical analysis, a [[numerical stability|numerically stable]] algorithm avoids magnifying small errors.
 == See also ==