DSA - Module 2

A finite sequence of instructions, typically used to solve problems or to perform calculations.

Algorithm criterias:

An algorithm has zero or more input quantities which are externally supplied taken from a set of objects called the domain of the algorithm.

Algorithm criterias:

It has one or more output quantities which generate a set called the range of the algorithm.

Algorithm criterias:

Each instruction must be clear and unambiguous, meaning each step of an algorithm must be

precisely defined.

Algorithm criterias:

If we trace out the instructions of an algorithm, then for all cases the algorithm will terminate after a finite number of steps.

Algorithm criterias:

Every instruction must be sufficiently basic that it can in principle, be carried out by a person by manual means and must generate a correct output.

the amount of memory space required by the algorithm during execution.

an algorithm requires space for the following:

• instruction space

• data space

• environment space

• memory space

A measure of the amount of time an algorithm takes to run as a function of the size of its input.

time complexity depends on the ff:

• machine execution time

• time to execute the instruction

• The instruction set

• translation (the use of compilers)

• value size