Question

define aigorithm and it's properties​

Answer 1

Answer:

An algorithm is an efficient and best method which can be used to express solution of any problem within a finite amount of space and time and in a well-defined formal language.

Properties of Algorithms:

Non Ambiguity

That means each instruction should be clear and precise. This property also indicates the effectiveness of algorithm.

Range of Input

The range of input should be specified. This is because normally the algorithm is input driven and if the range of input is not being specified then algorithm can go in an infinite state.

Multiplicity

The same algorithm can be represented into several different ways. That means we can write in simple English the sequence of instruction.

Speed

The algorithms written using some specified ideas. Bus such algorithm should be efficient and should produce the output with fast speed.

Finiteness

The algorithm should be finite. That means after performing required operations it should be terminate.