• 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

📚 Artikel Terkait di Wikipedia

Sorting algorithm

In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. The most frequently used orders are numerical order

Stable matching problem

matched factors stable. They presented an algorithm to do so. The Gale–Shapley algorithm (also known as the deferred acceptance algorithm) involves a number

Algorithms for calculating variance

the computation. Thus this algorithm should not be used in practice, and several alternate, numerically stable, algorithms have been proposed. This is

Gale–Shapley algorithm

Gale–Shapley algorithm (also known as the deferred acceptance algorithm, propose-and-reject algorithm, or Boston Pool algorithm) is an algorithm for finding

De Boor's algorithm

subfield of numerical analysis, de Boor's algorithm is a polynomial-time and numerically stable algorithm for evaluating spline curves in B-spline form

Numerical stability

approximation errors are called numerically stable. One of the common tasks of numerical analysis is to try to select algorithms which are robust – that is to say

Optimal stable matching

the men-optimal stable marriage; if women propose, the outcome is the women-optimal stable marriage. The run-time of this algorithm is O(m), where m

Introsort

performance requirements to be tightened. Introsort is in-place and a non-stable algorithm. If a heapsort implementation and partitioning functions of the type