WAEC Computer Studies 2023 Paper

A good algorithm must be "concise and finite."

Here's the breakdown of each term:

Concise: An algorithm should be clear and easy to understand without unnecessary complexity. A concise algorithm focuses on the essential steps needed to achieve the desired outcome.

Finite: An algorithm must have a well-defined endpoint. It should eventually stop executing and provide a result after a finite number of steps. This is important to ensure that the algorithm doesn't run indefinitely, which could lead to inefficiency or errors.