Which are characteristics of algorithms? Choose all that apply. are step-by-step instructions for solving a problem
are physical representations of solutions
will return expected results each time
can be used to communicate the solution to a problem

Step by step instructions for solving a problem

Explanation:

The characteristics An algorithm must always terminate after a finite number of steps. Each step of an algorithm must be precisely defined; the actions to be carried out must be rigorously and unambiguously specified for each case. You see each one depend on them uses the steps to each one of them.

Finiteness. An algorithm must always terminate after a finite number of steps.

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.

Input. An algorithm has zero or more inputs, i.e, quantities which are given to it initially before the algorithm begins.

Output. An algorithm has one or more outputs i.e, quantities which have a specified relation to the inputs.

Effectiveness. An algorithm is also generally expected to be effective. This means that all of the operations to be performed in the algorithm must be sufficiently basic that they can in principle be done exactly and in a finite length of time.

hi, you. i think this we be deleted because it's a invalid question.

(i suggest no to do this in the