Deterministic and non-deterministic algorithms are two fundamental categories of algorithms in computer science. Deterministic algorithms are those that produce the same output for a given input, whereas non-deterministic algorithms may produce different outputs for the same input depending on the context or randomization.
One example of a deterministic algorithm is the binary search algorithm. This algorithm searches for a value in a sorted array by repeatedly dividing the array in half and comparing the target value with the middle element. The algorithm is guaranteed to find the target value in logarithmic time, and it always produces the same output for the same input.
In contrast, an example of a non-deterministic algorithm is the Monte Carlo algorithm. This algorithm uses randomization to solve problems that are difficult to solve deterministically. One application of the Monte Carlo algorithm is in approximating the value of pi. By randomly generating points within a square and counting the number of points that fall within a circle inscribed within the square, the algorithm can estimate the value of pi.
Another example of a non-deterministic algorithm is the probabilistic algorithm. Probabilistic algorithms use a probabilistic decision-making process to arrive at the correct solution with high probability. The Las Vegas algorithm is a type of probabilistic algorithm that guarantees a correct output with high probability but does not guarantee a fixed running time.
Overall, deterministic algorithms are more straightforward and predictable, while non-deterministic algorithms are more flexible and powerful but require additional computational resources. The choice of which type of algorithm to use depends on the specific problem and requirements of the application.