Jump to content

Stable algorithm

From Wikipedia, the free encyclopedia
This is the current revision of this page, as edited by সাব্বির আলম (talk | contribs) at 04:27, 25 February 2022. The present address (URL) is a permanent link to this version.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)
  • 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

[edit]