As with all "classic algorithms," its output was deterministic: it produced the same result for the same input every time. It would always finish, and it always produced the optimal, correct result.

There is a new sorting algorithm a deterministic O(m log2/3 n)-time algorithm for single-source shortest paths (SSSP) on ...

This algorithm had two properties: It was “deterministic,” meaning that its decisions did not depend on any randomness, and it was also “smooth,” meaning that the books must be spread ...

Graeffe Transform: A method used to separate the magnitudes of the roots of a polynomial, playing a vital role in deterministic algorithms for root finding in finite fields.