A nondeterministic algorithm may exhibit different behavior across runs even when given the same input. The term contrasts with deterministic algorithms, which follow the same execution path and produce the same result under the same conditions.
An algorithm that, even for the same input, can exhibit different behaviors on different runs, as opposed to a deterministic algorithm.