Stable algorithm - Revision history

সাব্বির আলম at 04:27, 25 February 2022

2022-02-25T04:27:16Z

← Previous revision		Revision as of 04:27, 25 February 2022
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.
	* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors.		* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors. An algorithm is stable if the result produced is relatively insensitive to perturbations during computation.

	== See also ==		== See also ==

2022-02-25T04:24:03Z

Reverting possible vandalism by সাব্বির আলম to version by 111.68.103.203. Report False Positive? Thanks, ClueBot NG. (4138104) (Bot)

← Previous revision		Revision as of 04:24, 25 February 2022
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.
	* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors.~~An algorithm is stable if the result produced is relatively insensitive to perturbations during computation~~		* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors.

	== See also ==		== See also ==

2022-02-25T04:24:01Z

← Previous revision		Revision as of 04:24, 25 February 2022
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.
	* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors.		* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors.An algorithm is stable if the result produced is relatively insensitive to perturbations during computation

	== See also ==		== See also ==

2014-03-24T10:46:53Z

2014-03-24T10:46:30Z

2012-01-06T19:01:24Z

avoided redirection

← Previous revision		Revision as of 19:01, 6 January 2012
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* 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.		* In numerical analysis, a [[numerical stability\|numerically stable]] algorithm avoids magnifying small errors.

	== See also ==		== See also ==

2011-09-07T18:28:25Z

replace distribution-specific see-also link with dab pages

← Previous revision		Revision as of 18:28, 7 September 2011
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* 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.		* In numerical analysis, a [[numerically stable]] algorithm avoids magnifying small errors.

⚫	{{disambig}}

	== See also ==		== See also ==
			* [[Stable (disambiguation)]]
			* [[Stability (disambiguation)]]

		⚫	{{disambig}}
	* Another use of the word 'stable' is in a statistical context [[Stable distribution]].

2011-09-07T13:42:25Z

← Previous revision		Revision as of 13:42, 7 September 2011
Line 3:		Line 3:

	{{disambig}}		{{disambig}}

			== See also ==

			* Another use of the word 'stable' is in a statistical context [[Stable distribution]].

2011-09-07T12:16:23Z

rvv

← Previous revision		Revision as of 12:16, 7 September 2011
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* 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 ~~(~reddit)~~.		* In numerical analysis, a [[numerically stable]] algorithm avoids magnifying small errors.

	{{disambig}}		{{disambig}}

2011-09-07T12:06:11Z

← Previous revision		Revision as of 12:06, 7 September 2011
Line 1:		Line 1:
	* In computer science, a stable [[sorting algorithm]] preserves the order of records with equal keys.		* 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.		* In numerical analysis, a [[numerically stable]] algorithm avoids magnifying small errors (~reddit).

	{{disambig}}		{{disambig}}