Stable algorithm

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 article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.