Algorithms are used for calculation, data processing, and many other fields.

	Specific algorithms sometimes also go by the name method, procedure, or technique. The word "algorithm" is a distortion of al-Khwārizmī, a Persian mathematician who wrote an influential treatise about algebraic methods. The process of applying an algorithm to an input to obtain an output is called a computation. Algorithms are essential to the way computers process information.
Many computer programs contain algorithms that specify the specific instructions a computer should perform (in a specific order) to carry out a specified task, such as calculating employees’ paychecks or printing students’ report cards. An algorithm is a specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point.
Algorithms are essential to the way computers process information. Many computer programs contain algorithms that specify the specific instructions a computer should perform (in a specific order) to carry out a specified task, such as calculating employees’ paychecks or printing students’ report cards.
Start Action/ Process Decision   Subroutines Stop		Each algorithm is a list of well-defined instructionsfor completing a task. Starting from an initial state, the instructions describe a computation that proceeds through a well-defined series of successive states, eventually terminating in a final ending state.
The transition from one state to the next is not necessarily deterministic; some algorithms, known as randomized algorithms, incorporate randomness. Thus, an algorithm can be considered to be any sequence of operations that can be simulated by a Turing-complete system.

What is the Turing machine? It is hypothetical computing device proposed by Alan M. Turing; it is not actually a machine, it is an idealized mathematical model that reduces the logical structure of any computing device to its essentials.

It consists of an infinitely extensible tape, a tape headthat is capable of performing various operations on the tape, and a modifiable control mechanism in the head that can store instructions. As envisaged by Turing, it performs its functions in a sequence of discrete steps. His extrapolation of the essential features of information processing was instrumental in the development of modern digital computers, which share his basic scheme of:

• an input/output device (tape and tape reader),

• central processing unit (CPU, or control mechanism),

• and stored memory.

Alan Turing visualized a "state machine" that was capable of basic computing. He never actually built his Turing Machine but people have paid homage to him by creating modern examples of the machine that he imagined. A state machine is a device which is controlled by the "current state" and a set of instructions which determines the "next state". In other words, a prototype for the computers of today.

Algorithms can be expressed in many kinds of notation, including natural languages, pseudocode, flowcharts, and programming languages.

Natural language expressions of algorithms tend to be verbose and ambiguous, and are rarely used for complex or technical algorithms.

Pseudocode and flowcharts are structured ways to express algorithms that avoid many of the ambiguities common in natural language statements, while remaining independent of a particular implementation language.

Pseudocode is a computing notation resembling a simplified programming language, used in program design. Flow chartis a graphical representation of a computer program in relation to its sequence of functions (as distinct from the data it processes).

Date: 2015-12-17; view: 921