Jump to content

Deterministic algorithm

From Simple English Wikipedia, the free encyclopedia

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.