ds characteristics of an algorithm 3.2a

Unambiguous

should be clear and concise; the inputs and outputs should be clear and all steps of the procedure explicit.

Finite

must have a finite number of steps that end once they have been completed.
The algorithm must stop eventually with either the expected output or a response that indicates that there is no solution.

Well defined

making very specific the steps to be taken and in what order. Details of each step must be explicit, including how to handle any errors.

Inputs

the data, which will be transformed by the procedure

Outputs

the data that has been transformed by the process

Feasible

the procedure must be possible with the available resources and not contain any redundant unnecessary steps

Independent

The algorithm should have step. by step instructions and be independent of any programming language