Stable algorithm
From Wikipedia, the free encyclopedia
- In computer science, a stable sorting algorithm is a sorting algorithm that preserves the order of records with equal keys.
- In numerical analysis, a numerically stable algorithm is an algorithm that is numerically stable.
 |
This disambiguation page lists articles associated with the same title. If an internal link led you here, you may wish to change the link to point directly to the intended article. |
