THE MEANING OF ALGORITHM

An algorithm usually means a small procedure that solves a recurrent problem.

DEFINITION A process or set of rules to be followed in calculations or other problem-solving operations, esp. by a computer.

ALGORITHM
The construction and analysis of algorithms and data structures is a basic and very important part of modern computer science. Its importance increases also by the rapid development of more powerful and faster computers. All computer.

Step by step procedure designed to perform an operation, and which (like a map or flowchart) will lead to the sought result if followed correctly. Algorithms have a definite beginning and a definite end, and a finite number of steps. An algorithm produces the same output information given the same input information, and several short algorithms can be combined to perform complex tasks such as writing a computer program.

COMPUTR ALGORITHM

To make a computer do anything, you have to write a computer program. To write a computer program, you have to tell the computer, step by step, exactly what you want it to do. The computer then "executes" the program, following each step mechanically, to accomplish the end goal. When you are telling the computer what to do, you also get to choose how it's going to do it. That's where computer algorithms come in. The algorithm is the basic technique used to get the job done.

 Definition of Algorithm Design algorithm Design introduces algorithms by looking at

the real-world problems that motivate them. In a clear, straight-forward style.The text encourages a greater understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

Algorithm Design

Algorithm design is a specific method to create a mathematical process in solving problems. Applied algorithm design is algorithm engineering. Algorithm design is identified and incorporated into many solution theories of operation research, such as dynamic programming and divide-and-conquer. Techniques for designing and implementing algorithm designs are algorithm design patterns, such as template method patterns and decorator patterns, and uses of data structures, and name and sort lists. Some current day uses of algorithm design can be found in internet retrieval processes of web crawling, packet routing and caching. Mainframe programming languages such as ALGOL (for Algorithmic language), FORTRAN, COBOL, and SNOBOL are computing tools to implement an "algorithm design"... but, an "algorithm design" (a/d) is not a language. An a/d can be a hand written process, e.g. set of equations, a series of mechanical processes done by hand, an analog piece of equipment, or a digital process and/or processor. One of the most important aspects of algorithm design is creating an algorithm that has an efficient run time, also known as its big Oh.

Definition of Implementation
Most algorithms are intended to be implemented as

computer programs. However, algorithms are also implemented by other means, such as in a biological neural network (for example, the human brain implementing arithmetic or an insect looking for food), in an electrical circuit, or in a mechanical device.

CLASSIFICATION BY IMPLEMENTATION

An algorithm may be implemeted according to different basical principles.

Recursive or iterative
A recursive algorithm is one that calls itself repeatedly until a certain condition matches. It is a method common to functional programming. Iterative algorithms use repetitive constructs like loops.

Logical or procedural
An algorithm may be viewed as controlled logical deduction. This is the basis of the logic programming. In pure logic programming languages the control component is fixed and algorithms are specified by supplying only the logic component.

Serial or parallel
Algorithms are usually discussed with the assumption that computers execute one instruction of an algorithm at a time. This is a serial algorithm, as opposed to parallel algorithms, which take advantage of computer architectures to process several instructions at once.

Deterministic or non-deterministic
Deterministic algorithms solve the problem with a predefined process whereas non-deterministic algorithm must perform guesses of best solution at each step through the use of heuristics.

PREPARED BY: SALMA SABIR B.S (IT) ROLL# 17 SUBJECT I.C.T