An algorithm is a sequence of computational step that transfer the input into the output. Thus we can say that an algorithm can be define as a sequence of definite instruction which when following will achieve some purpose.
Algorithm is branch of computer science that consist of designing and analyzing computer system.
The design
a) Description of algorithm at an abstract level by means of a pseudo language.
b) Prof of correction that is the algorithm solve the given problem in all cases.
Types of Algorithm -
1. Incremental Algorithm.
2. Divide and Conquer Algorithm.
Divide - Divide the problem into a number of sub problem.
Conqueer - The sub problem by solving them recursivily.
Combine - The solution to the sub problem into the solution for the original problem.
EVERY ALGORTHM MUST SATISFIED THE FOLLOWING CRITERIA
INPUT -
There are zero or more value which are externally supplied.
Output -
At least one value is produce.
Definitness -
Each step must be clear and unambigous.
Fitiness - If we trace the step of an algorithm then for all cases, the algorthm must terminate after a number of step -
Effectiveness -
Each step must be sufficiently basic that it can in principal be carred out by a person using only paper and pencil. In addition not only each step be definite it must also be feasible.
ANALYSIS OF ALGORITHM
(Algorithm Complexity)
The choice of particular algorthm depends on following performance analysis and measurement.
Space Complexity -
Analysis of space complexity of an algorithm or program is the amount of memory. It needs to run to completion.
The space needed by a program consist the following -
Instruction Space -
Space needed to store the executable version of the program and it is fixed.
Data Space -
Space needed to store all constable, variable this space is fixed.
Time Complexity -
The time complexity of an algorithm or a program is the amount of time. It needs to run to completion. The exact time will depend on the implementation of the algorithm, programming language, optimizing the capacity of the computer use the CPU speed and hardware characteristics specification and so. on.
Algorithm is branch of computer science that consist of designing and analyzing computer system.
The design
a) Description of algorithm at an abstract level by means of a pseudo language.
b) Prof of correction that is the algorithm solve the given problem in all cases.
Types of Algorithm -
1. Incremental Algorithm.
2. Divide and Conquer Algorithm.
Divide - Divide the problem into a number of sub problem.
Conqueer - The sub problem by solving them recursivily.
Combine - The solution to the sub problem into the solution for the original problem.
EVERY ALGORTHM MUST SATISFIED THE FOLLOWING CRITERIA
INPUT -
There are zero or more value which are externally supplied.
Output -
At least one value is produce.
Definitness -
Each step must be clear and unambigous.
Fitiness - If we trace the step of an algorithm then for all cases, the algorthm must terminate after a number of step -
Effectiveness -
Each step must be sufficiently basic that it can in principal be carred out by a person using only paper and pencil. In addition not only each step be definite it must also be feasible.
ANALYSIS OF ALGORITHM
(Algorithm Complexity)
The choice of particular algorthm depends on following performance analysis and measurement.
Space Complexity -
Analysis of space complexity of an algorithm or program is the amount of memory. It needs to run to completion.
The space needed by a program consist the following -
Instruction Space -
Space needed to store the executable version of the program and it is fixed.
Data Space -
Space needed to store all constable, variable this space is fixed.
Time Complexity -
The time complexity of an algorithm or a program is the amount of time. It needs to run to completion. The exact time will depend on the implementation of the algorithm, programming language, optimizing the capacity of the computer use the CPU speed and hardware characteristics specification and so. on.
Comments
Post a Comment