Unambiguous: Each step in the algorithm should be clear and precisely defined, leaving no room for interpretation.
Finite: The algorithm must always terminate after a finite number of steps. It shouldn’t get stuck in an infinite loop.
Well-defined Input: The algorithm should clearly specify the type and format of the input it expects.
Well-defined Output: The algorithm should clearly specify the type and format of the output it produces, and this output should have a defined relationship to the input.
Effective: The algorithm should actually solve the intended problem.
Efficient (Desirable): While not strictly required for something to be an algorithm, efficiency in terms of time and resources is often a crucial consideration in practice.