(minor edit, rm {{pna-unformatted}} no talk) |
Captainmike (talk | contribs) (replacing pna unformatted -- no talk page comment is required for this, its obvious from the boilerplate it is, in fact, unformatted) |
||
| Line 7: | Line 7: | ||
For more information, see [http://en.wikipedia.org/wiki/Recursive_algorithm Recursion] on Wikipedia |
For more information, see [http://en.wikipedia.org/wiki/Recursive_algorithm Recursion] on Wikipedia |
||
| + | {{pna-unformatted}} |
||
Revision as of 16:57, 10 May 2005
A recursive algorithm is an algorithm that is defined in terms of itself. In order for such an algorithm to be finite, it must contain a base case along with the recursive part. For example, you can define the factorial operation with n! = n(n - 1)! as the recursive part and 1! = 0! = 1 as the base case
It has been noted that most Cardassian encryption codes are based on recursive algorithms.
See also:
For more information, see Recursion on Wikipedia
This article is unformattedThis page requires formatting – possibly including wikification, and adherence to the Manual of Style – and has been identified as needing attention. Please feel free to edit this page to assist with this task.