Algorithm

In mathematics and computing, the algorithm is a set of commands to solve a problem. These commands can be translated in stages from beginning to the end. These problems can be anything, with records for every problem, there are criteria for initial conditions that must be met before running the algorithm. The algorithm will be able to always end for all initial conditions that meet the criteria, in this case different from the heuristic. Algorithms often have steps repetition (iteration) or require decisions (Boolean logic and comparison) until the task is completed.

Design and analysis of algorithms is a special branch of computer science that studies the characteristics and performance of the algorithm in solving the problem, regardless of the algorithm implementation. In this branch of the discipline learned in the abstract algorithm, regardless of the

computer system or programming language used. Different algorithms can be applied to a problem with the same criteria.

The complexity of an algorithm is a measure of how much the algorithm computation required to solve the problem. Informally, an algorithm that can solve a problem in a short time have a low complexity, while the algorithms which take a long time to resolve the problem has high complexity.

The word algorithm is derived from the name of a mathematician latinization of Uzbekistan Al Khwarizmi (lived around the 9th century), as stated on his work in the Latin translation of the 12th century "Algorithmi de numero Indorum". At first algorisma word is a term that refers to the rules of arithmetic means to resolve the problem by using numerical arabic numbers (actually from India, as written on the title above). In the 18th century, the term evolved into the algorithm, which includes all procedures or the sequence of steps required to clear and settle a problem.

Types of Algorithms

There are a variety of classification algorithms and each classification has its own reasons. One way to classify the types of algorithms is to consider the paradigm and methods used to design the algorithm. Some paradigms are used to evolve an algorithm will be presented in this section. Each paradigm can be used in many different algorithms.

1 Divide and Conquer paradigm to divide a large problem into problems smaller. Distribution of this problem is done continuously until the problem is found a small, easy to solve. In short finish the whole problem by dividing a big problem and then solve small problems that are formed.

2 Dynamic programming, dynamic programming paradigm would be appropriate if it is used on a problem containing a sub-optimal structure (and contains some of the problems that overlap. Paradigm glance looks similar to the Divide and Conquer paradigm, both trying to divide problem into smaller sub-problems, but is intrinsically no different from the problems faced character.

3. greedy method. A greedy algorithm is similar to a dynamic programming, the difference between the answers of subproblems need not be known in every stage; and use the option "greedy" what is seen best at the time.

Computer programs (often referred to as the program only) is an application created by using a particular programming language and has been installed on the computer. The algorithm is implemented in a computer understandable language [David Man 2003]. The computer program is an example of computer software that writes computing the action that will be executed by the computer.

Computing is usually implemented by an algorithm or a sequence of commands tertentu.Urutan command (or algorithm) is a device that is already included in the algorithm tersebut.Tanpa computer program, computer programs can not run well.

Flow diagram (flowchart) is the result of the conversion of an algorithm using a raw symbol [ANSI / IBM]. Artifacts raw structure flowchart are:
1. coherently (sequential / linear)
2 Alternative / choice / selection (alternative / selection)
3 Repeated (loop / repetition)