- 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.
Stable algorithm
Topics referred to by the same term