Is greedy algorithm non deterministic by nature?

Answer: Yes

Explanation: Greedy algorithm is the algorithm that gives the solution to the problem on the basis of the piece by piece or step by step architecture. the next step of the solution is based on the aim of solving problem optimally. But the steps chosen can be correct or incorrect.

Non-deterministic nature is the feature that determines that the steps that is being chosen is not the most optimal one and no high surety is present. Thus, this nature is present in the greedy algorithm and it has non-deterministic nature.