---
title: Stable algorithm
slug: stable-algorithm
qid: 
snapshot: enwiki-001073874804
content_hash: 
license: CC BY-SA 4.0
source: https://en.wikipedia.org/w/index.php?oldid=1073874804
tags: [23118434, 3564997, 3566086, 4410601]
---

# Stable algorithm

> [!note] Provenance
> Snapshot `enwiki-001073874804` · content root `…`
> Derived from <https://en.wikipedia.org/w/index.php?oldid=1073874804> · Licensed CC BY-SA 4.0

* 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.

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.
