SkipCaptcha
3,261
edits
Changes
Jump to navigation
Jump to search
Line 1:
Line 1: − [http://conservapedia.com/Recursion Recursion]<ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref><ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref><ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref><ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref><ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref><ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref><ref>[http://conservapedia.com/Recursion See http://conservapedia.com/Recursion]</ref> is a technique whereby a [[function]], in order to accomplish a task, calls [http://conservapedia.com/Recursion itself] to accomplish part of the task. [http://conservapedia.com/Recursion Recursion] is notable for having the word "[http://conservapedia.com/Recursion recursion]" in itself.+ Line 6:
Line 6: − + − ::4. If that fails, [http://conservapedia.com/Recursion this] article provides more information on [http://conservapedia.com/Recursion recursion] Line 15:
Line 14: − :4. Write an article about [http://conservapedia.com/Recursion recursion]; attempt to reference the article in itself as many times as possible <ref> Like I'm doing now, also see http://conservapedia.com/Recursion</ref> − − If you still don't understand, see [http://conservapedia.com/Recursion recursion] − − − ===References=== − <references/>
revert to last real revision
'''Recursion''' is a technique whereby a [[function]], in order to accomplish a task, calls itself to accomplish part of the task.
Every recursive solution involves two major parts or cases, the second part having three components:
Every recursive solution involves two major parts or cases, the second part having three components:
* recursive case(s). A recursive case has three components:
* recursive case(s). A recursive case has three components:
::1. divide the problem into one or more simpler or smaller parts of the problem,
::1. divide the problem into one or more simpler or smaller parts of the problem,
::2. call the function [http://conservapedia.com/Recursion (recursively)] on each part, and
::2. call the function (recursively) on each part, and
::3. combine the solutions of the parts into a solution for the problem.
::3. combine the solutions of the parts into a solution for the problem.
These exercises are useful to see examples of recursion:
These exercises are useful to see examples of recursion:
:2. Write a function to compute 2 to the power of a non-negative integer.
:2. Write a function to compute 2 to the power of a non-negative integer.
:3. Write a function to compute any number to the power of a non-negative integer.
:3. Write a function to compute any number to the power of a non-negative integer.
[[Category:Computer Science]]
[[Category:Computer Science]]