Recursion - Revision history

DavidB4-bot: clean up

2016-06-23T15:04:39Z

clean up

Ed Poor: cat math

2016-02-18T17:09:09Z

cat math

Ed Poor: divisibility by three

2016-02-18T17:08:32Z

divisibility by three

NKeaton: Add link, clarify, and remove silly sentence

2013-02-26T14:23:27Z

Add link, clarify, and remove silly sentence

WilcoxD at 02:47, January 31, 2013

2013-01-31T02:47:49Z

JamesWilson: revert to last real revision

2011-08-12T23:32:47Z

revert to last real revision

JonS at 23:27, August 12, 2011

2011-08-12T23:27:08Z

AlexWD: Undo revision 749963 by TrueClarity (Talk)

2010-01-28T05:49:04Z

Undo revision 749963 by TrueClarity (Talk)

TrueClarity: Undo revision 749962 by AlexWD (Talk)

2010-01-28T05:48:27Z

Undo revision 749962 by AlexWD (Talk)

AlexWD: Undo revision 749961 by TrueClarity (Talk)

2010-01-28T05:48:08Z

Undo revision 749961 by TrueClarity (Talk)

@@ Line 1: / Line 1: @@
 '''Recursion''' is the repeated application of a procedure or definition through reference to itself.
-===In Mathematics===
+==In Mathematics==
 There's a simple procedure for finding out whether a number is divisible by three.
@@ Line 13: / Line 13: @@
-===In Computing===
+==In Computing==
 Recursion is a technique whereby a [[function]], in order to accomplish a task, calls itself to accomplish part of the task.
@@ Line 32: / Line 32: @@
 ==External links==
-[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-1/lecture-6-recursion/ Unit on recursion in free online computer science course from MIT.]
+* [http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-1/lecture-6-recursion/ Unit on recursion in free online computer science course from MIT.]
 [[Category:Computer Science]]
-[[category: mathematics]]
+[[Category:Mathematics]]

← Older revision		Revision as of 17:09, February 18, 2016
Line 35:		Line 35:

	[[Category:Computer Science]]		[[Category:Computer Science]]
		+	[[category: mathematics]]

← Older revision		Revision as of 17:08, February 18, 2016
Line 1:		Line 1:
	'''Recursion''' is the repeated application of a procedure or definition through reference to itself.		'''Recursion''' is the repeated application of a procedure or definition through reference to itself.
		+
		+	===In Mathematics===
		+
		+	There's a simple procedure for finding out whether a number is divisible by three.
		+	#If the number is 3, 6, or 9 then it's divisible by three.
		+	#Otherwise, add all the digits of the number; if the sum of the digits is divisible by three, then so is the original number.
		+
		+	Examples:
		+	* 12 => 1 + 2 = 3 (yes)
		+	* 14 => 1 + 4 = 5 (no)
		+	* 96 => 9 + 6 = 15; 15 => 1 + 5 = 6
		+

	===In Computing===		===In Computing===

@@ Line 1: / Line 1: @@
-'''Recursion''' is the repeated application of a procedure or definition.
+'''Recursion''' is the repeated application of a procedure or definition through reference to itself.
 ===In Computing===
@@ Line 19: / Line 19: @@
 :3. Write a function to compute any number to the power of a non-negative integer.
-===In Language===
+==External links==
+[http://ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-00sc-introduction-to-computer-science-and-programming-spring-2011/unit-1/lecture-6-recursion/ Unit on recursion in free online computer science course from MIT.]
 [[Category:Computer Science]]

@@ Line 1: / Line 1: @@
-'''Recursion''' is a technique whereby a [[function]], in order to accomplish a task, calls itself to accomplish part of the task.
+'''Recursion''' is the repeated application of a procedure or definition.
 Every recursive solution involves two major parts or cases, the second part having three components:
@@ Line 13: / Line 17: @@
 :1. Write a function to compute the sum of all numbers from 1 to n.
 :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.
 [[Category:Computer Science]]

@@ 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.
+'''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:
@@ Line 6: / Line 6: @@
 * recursive case(s). A recursive case has three components:
 ::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.
 These exercises are useful to see examples of recursion:
@@ Line 15: / Line 14: @@
 :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.
 [[Category:Computer Science]]

← Older revision		Revision as of 05:49, January 28, 2010
Line 1:		Line 1:
−	~~#REDIRECT~~ [[~~Recursion~~]]	+	'''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:
		+
		+	* base case(s), in which the problem is simple enough to be solved directly, and
		+	* recursive case(s). A recursive case has three components:
		+	::1. divide the problem into one or more simpler or smaller parts of the problem,
		+	::2. call the function (recursively) on each part, and
		+	::3. combine the solutions of the parts into a solution for the problem.
		+
		+	These exercises are useful to see examples of recursion:
		+
		+	:1. Write a function to compute the sum of all numbers from 1 to n.
		+	: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.
		+
		+	[[Category:Computer Science]]

← Older revision		Revision as of 05:48, January 28, 2010
Line 1:		Line 1:
−	~~'''Recursion''' is a technique whereby a~~ [[~~function]], in order to accomplish a task, calls itself to accomplish part of the task.~~	+	#REDIRECT [[Recursion]]
−
−	~~Every recursive solution involves two major parts or cases, the second part having three components:~~
−
−	* base case(s), in which the problem is simple enough to be solved directly, and
−	* recursive case(s). A recursive case has three components:
−	~~::1. divide the problem into one or more simpler or smaller parts of the problem,~~
−	~~::2. call the function (recursively) on each part, and~~
−	~~::3. combine the solutions of the parts into a solution for the problem.~~
−
−	~~These exercises are useful to see examples of recursion:~~
−
−	~~:1. Write a function to compute the sum of all numbers from 1 to n.~~
−	~~: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.~~
−
−	~~[[Category:Computer Science~~]]