Question

some faults that violate the property of termination of an algorithm in finite amount of time they are​

Answer 1

Answer:

An algorithm is a well-ordered collection of unambiguous and effectively computable operations that when executed produces a result and halts in a finite amount of time [Schneider and Gersting 1995]. ... Algorithms produce a result. Algorithms halt in a finite amount of time.

Explanation:

please follow and brainliest