Which of the following is a characteristic of an algorithm?

• A. The steps must be finite
• B. Each step must be clear and unambiguous
• C. Every step must be basic and essential
• D. Inputs and outputs are included

Answer: (A)

An algorithm is defined by its ability to terminate after a finite number of steps. This finiteness guarantees that the process will produce a result and not run forever, making the method executable and analyzable in terms of time and resources. While it’s true that each step should be clear and unambiguous so it can be carried out, and that algorithms typically take input and produce output, the essential trait highlighted here is that the steps must be finite to ensure eventual completion.