From Wikipedia, the free encyclopedia
Revision as of 04:27, 25 February 2022 by imported>সাব্বির আলম
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation
Jump to search
- 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
Template:Disambig