Question

Finiteness of an algorithm implies

Answer 1

Answer:

Finiteness: "An algorithm must always terminate after a finite number of steps a very finite number, a reasonable number" Definiteness: "Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case"

hope it was helpful to you ☺️☺️

mark me brainlist ❣️❣️

Answer 2

Explanation:

Finiteness: "An algorithm must always terminate after a finite number of steps ... a very finite number, a reasonable number" Definiteness: "Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case"