| Algorithm is a procedure or formula for solving a | | | | matches which is commonly used in functional |
| problem, it is a finite list of steps taken to solve a | | | | programming while Iteration uses repetition and |
| particular problem or give a desired result. An | | | | sometimes additional data structures to solve given |
| algorithm is an effective method for solving a | | | | problems, other forms of implementation could be |
| problem expressed as a finite sequence of | | | | logical, serial, parallel, deterministic or non-deterministic, |
| instructions. It can also be put a list of well-defined | | | | exact or approximate. Under design paradigm could |
| instruction for completing a task. Computer programs | | | | be exhaustive search that tries all possible solution to |
| can sometimes be viewed as an elaborate algorithm | | | | know which one is best, divide and conquer splits up |
| with small procedure solving recurrent problems. | | | | a problem into smaller instances until they can be |
| Algorithm for some people is a program that stops | | | | solved easily as smaller pieces, dynamic programming, |
| after a certain number of calculation steps while | | | | linear programming, search and elimination and so on. |
| others believe it is an algorithm when the program | | | | It should be noted that an algorithm does not put |
| stops eventually. It can be performed manually and in | | | | you into an infinite loop rather it is a path to a final |
| most cases nowadays, write a computer program | | | | conclusion. Algorithm is easily applicable to all kinds of |
| for it. | | | | engineering and theories. Though could sometimes be |
| Around 780-850 AD, a Persian mathematician and | | | | seen as basically unjustified, and incapable of |
| astrologer Mohammed bin-Musa al-Khwarizm was | | | | justification in and of themselves. This is really a basic |
| believed to have developed the concept of algorithm | | | | and very powerful idea. It is completely flexible, and |
| during some arithmetic calculations. The partial | | | | can grow and change as the various conclusions and |
| formalization of the concept started as an attempt | | | | outcomes are examined. |
| to solve the decision problem posed by David Hilbert | | | | Some common forms of algorithm include |
| in 1928. Other subsequent formalization included the | | | | combinatorial algorithm (graph and sequence) |
| Godel-Herbrand-Kleene recursive functions of 1930, | | | | computational mathematics (abstract algebra, |
| 1934 and 1935, Alonzo Church's lambda calculus of | | | | computer algebra, geometry, number theoretic |
| 1936, Emil Post's "Formulation 1" of 1936, and Alan | | | | algorithms, numerical algorithm and optimization |
| Turing's Turing machines of 1936-7 and 1939. | | | | algorithm) computational science (astronomy, |
| Classification can be based on the following; | | | | bioinformatics, geoscience, linguistics, medicine, |
| implementation, design paradigm, field of study, | | | | physics and statistics). Others include computer |
| complexity and computing power. Classification by | | | | science, information theory, signal processing and |
| implementation could be recursion or iteration makes | | | | software engineering. |
| reference to itself repeatedly until a certain condition | | | | |