Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia
Revision as of 14:27, 7 December 2011 by WikitanvirBot (talk | changes) (r2.7.1) (Robot: Adding fa:الگوریتم قطعی)

A deterministic algorithm is a computer science term. Functions are deterministic when if you never change what you give it (the input), that what you get out (the output) never changes either; and you can do this as many times as you want.