Question

The algorithm always ends with a ……………………….​

Answer 1

Answer:

The informal definitions of algorithms generally require that the algorithm always terminates. This requirement renders the task of deciding whether a formal procedure is an algorithm impossible in the general case—due to a major theorem of computability theory known as the halting problem.

Answer 2

Stop because this is a rule