Difference between revisions of "Algorithm"
(New page: An algorithm is a mathematical rule or procedure for solving a problem that is applied in other sciences like Computer Science, where it plays a very significant role. Algorithms can be im...) |
5849206328x (talk | contribs) |
||
| Line 1: | Line 1: | ||
An algorithm is a mathematical rule or procedure for solving a problem that is applied in other sciences like Computer Science, where it plays a very significant role. Algorithms can be implemeted as pseudocode, flowcharts or written text. The running time of an algorithm describes the time it needs to run in a polynomial form. Thus, there are P and NP problems. An NP problem does not have a standard solution, contrary to P problems. | An algorithm is a mathematical rule or procedure for solving a problem that is applied in other sciences like Computer Science, where it plays a very significant role. Algorithms can be implemeted as pseudocode, flowcharts or written text. The running time of an algorithm describes the time it needs to run in a polynomial form. Thus, there are P and NP problems. An NP problem does not have a standard solution, contrary to P problems. | ||
| + | |||
| + | {{stub}} | ||
| + | [[Category:Computer Science]] | ||
Revision as of 12:16, 1 July 2009
An algorithm is a mathematical rule or procedure for solving a problem that is applied in other sciences like Computer Science, where it plays a very significant role. Algorithms can be implemeted as pseudocode, flowcharts or written text. The running time of an algorithm describes the time it needs to run in a polynomial form. Thus, there are P and NP problems. An NP problem does not have a standard solution, contrary to P problems.
This article is a stub. Help us out by expanding it.
