Editing Deterministic algorithm (section)

{{Short description|Type of algorithm in computer science}}
{{distinguish|Idempotency}}

In [[computer science]], a '''deterministic algorithm''' is an [[algorithm]] that, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states. Deterministic algorithms are by far the most studied and familiar kind of algorithm, as well as one of the most practical, since they can be run on real machines efficiently.

Formally, a deterministic algorithm computes a [[function (mathematics)|mathematical function]]; a function has a unique value for any input in its [[function domain|domain]], and the algorithm is a process that produces this particular value as output.