1. Introduction to the Concept of Algorithms
In this entire subject we have to learn about what is an algorithm
where it is required in the environment of computer science.
Whenever you have a problem to solve, then only you require an
algorithm. In the process of solving, you require to design an
algorithm for a particular problem next one is analysis of an
algorithm. Problem for a particular problem, you need to have a
procedure that you can design with that is you call it as algorithm
the solution algorithmic solution. Problem to solve and that
problem for a particular problem, you need to find it out. Means
that may be a procedure let us suppose if i ask you to prepare
your coffee you may say that the first step is to take a bowl then
you can go for lighting of the stove.
, 2. Definition of an algorithm
An algorithm is a sequence of fun, ambiguous instructions for
solving a problem. It has to take input and it has to provide the
output with a finite amount of time that means it never goes to
infinity. The typical requirements are properties of properties of
final, so what are those properties? The girl Gotham terminates
after a finite number of steps that means the algorithm must
terminate for some concerns. It is terminating the other concern if
it does not terminate definitely you can not call it an algorithm. If
you are giving some input it definitely gives some output that's
why at least one quantities produce so these five properties are
taken into consideration whenever you write an algorithm that is
definite its effectiveness finiteness.
In this entire subject we have to learn about what is an algorithm
where it is required in the environment of computer science.
Whenever you have a problem to solve, then only you require an
algorithm. In the process of solving, you require to design an
algorithm for a particular problem next one is analysis of an
algorithm. Problem for a particular problem, you need to have a
procedure that you can design with that is you call it as algorithm
the solution algorithmic solution. Problem to solve and that
problem for a particular problem, you need to find it out. Means
that may be a procedure let us suppose if i ask you to prepare
your coffee you may say that the first step is to take a bowl then
you can go for lighting of the stove.
, 2. Definition of an algorithm
An algorithm is a sequence of fun, ambiguous instructions for
solving a problem. It has to take input and it has to provide the
output with a finite amount of time that means it never goes to
infinity. The typical requirements are properties of properties of
final, so what are those properties? The girl Gotham terminates
after a finite number of steps that means the algorithm must
terminate for some concerns. It is terminating the other concern if
it does not terminate definitely you can not call it an algorithm. If
you are giving some input it definitely gives some output that's
why at least one quantities produce so these five properties are
taken into consideration whenever you write an algorithm that is
definite its effectiveness finiteness.
